2 search results - page 1 / 1 » Infeasibility of Instance Compression and Succinct PCPs for ... |
ECCC
2007
13 years 4 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...