3415 search results - page 72 / 683 » Lower bounds on kernelization |
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
131
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
AFRICACRYPT
2008
Springer
15 years 10 months ago
2008
Springer
CISS
2007
IEEE
15 years 10 months ago
2007
IEEE