2 problems
Matching
Let be a matroid on ground set , let be an abelian group, let be a labeling, let be finite, and let be arbitrary costs. F…
Fixed-pattern avoidance conjecture. The permutation pattern matching problem with text and pattern can be solved in time .