3415 search results - page 211 / 683 » Lower bounds on kernelization |
160
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
158
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...
120
click to vote
MST
2006
15 years 6 months ago
2006
We study a popular pencil-and-paper game called morpion solitaire. We present upper and lower bounds for the maximum score attainable for many versions of the game. We also show t...
157
click to vote
RSA
2006
15 years 6 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
171
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...