Lance Fortnow
Rahul Santhanam
ABSTRACT
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 from OR-SAT to any set A where the length of the output is bounded by a polynomial in n, unless NP ⊆ coNP/poly, and the Polynomial-Time Hierarchy collapses. This result settles an open problem proposed by Bodlaender et. al. [4] and Harnik and Naor [15] and has a number of implications. A number of parametric $\NP$ problems, including Satisfiability, Clique, Dominating Set and Integer Programming, are not instance compressible or polynomially kernelizable unless NP ⊆ coNP/poly. Satisfiability does not have PCPs of size polynomial in the number of variables unless NP ⊆ coNP/poly. An approach of Harnik and Naor to constructing collision-resistant hash functions from one-way functions is unlikely to be viable in its present form. (Buhrman-Hitchcock) There are no subexponential-size hard sets for NP unless NP is in co-NP/poly. We also study probabilistic variants of compression, and show various results about and connections between these variants. To this end, we introduce a new strong derandomization hypothesis, the Oracle Derandomization Hypothesis, and discuss how it relates to traditional derandomization assumptions.
- L. Adleman. Two theorems on random polynomial time. In Proceedings of the 20th Annual IEEE Symposium on the Foundations of Computer Science, pages 75--83, 1978. Google Scholar
Digital Library
- S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501--555, 1998. Google ScholarDigital Library
- S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70--122, 1998. Google ScholarDigital Library
- H. Bodlaender, R. Downey, M. Fellows, and D. Hermelin. On problems without polynomial kernels. Manuscript, 2007.Google Scholar
- H. Buhrman and J. Hitchcock. NP-complete sets are exponentially dense unless NP ⊆ co-NP/poly. In Proceedings of 23rd Annual IEEE Conference on Computational Complexity, 2008. To appear. Google ScholarDigital Library
- J.-Y. Cai, V. Chakaravarthy, L. Hemaspaandra, and M. Ogihara. Competing provers yield improved Karp--Lipton collapse results. Information and Computation, 198(1):1--23, 2005. Google ScholarDigital Library
- L. Cai, J. Chen, R. Downey, and M. Fellows. Advice classes of parameterized tractability. Annals of Pure and Applied logic, 84(1):119--138, 1997.Google ScholarCross Ref
- S. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pages 151--158, 1971. Google ScholarDigital Library
- I. Dinur. The PCP theorem by gap amplification. Journal of the ACM, 54(3), 2007. Google ScholarDigital Library
- R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, 1999. Google ScholarCross Ref
- B. Dubrov and Y. Ishai. On the randomness complexity of efficient sampling. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 711--720, 2006. Google ScholarDigital Library
- J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006. Google Scholar
- L. Fortnow and R. Santhanam. Infeasibility of instance compression and succinct PCPs for NP. Electronic Colloquium on Computational Complexity (ECCC), 14(96), 2007.Google Scholar
- J. Guo and R. Niedermeier. Invitation to data reduction and problem kernelization. ACM SIGACT News, 38(1):31--45, 2007. Google ScholarDigital Library
- D. Harnik and M. Naor. On the compressibility of NP instances and cryptographic applications. In Proceedings if the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 719--728, 2006. Google ScholarDigital Library
- R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 220--229, 1997. Google ScholarDigital Library
- Y. T. Kalai and R. Raz. Interactive PCP. Electronic Colloquium on Computational Complexity, 7(31), 2007.Google Scholar
- R. Karp and R. Lipton. Turing machines that take advice. L’Enseignement Mathématique, 28(2):191--209, 1982.Google Scholar
- A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. SIAM Journal of Computing, 31(5):1501--1526, 2002. Google ScholarDigital Library
- S. Mahaney. Sparse complete sets for NP: Solution of a conjecture of berman and hartmanis. Journal of Computer and System Sciences, 25(2):130--143, 1982.Google ScholarCross Ref
- R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.Google ScholarCross Ref
- R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001. Google ScholarDigital Library
- D. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? Advances in Cryptology, EUROCRYPT 1998, Lecture Notes in Computer Science, 1403:334--345, 1998.Google ScholarCross Ref
- C.-K. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287--300, 1983.Google ScholarCross Ref
Index Terms
- Infeasibility of instance compression and succinct PCPs for NP
Recommendations
Infeasibility of instance compression and succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae @f"1,...,@f"m each of size at most n, whether at least one of the @f"i's is satisfiable. We show that there is no reduction from OR-SAT to any set A where the length of the output is bounded by a ...
New Limits to Classical and Quantum Instance Compression
FOCS '12: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer ScienceGiven an instance of a hard decision problem, a limited goal is to \emph{compress} that instance into a smaller, equivalent instance of a second problem. As one example, consider the problem where, given Boolean formulas $\psi^1, \ldots, \psi^t$, we ...
The shrinking property for NP and coNP
We study the shrinking and separation properties (two notions well-known in descriptive set theory) for NP and coNP and show that under reasonable complexity-theoretic assumptions, both properties do not hold for NP and the shrinking property does not ...
Comments