Infeasibility of instance compression and succinct PCPs for NP

Journal of Computer and System Sciences

Volumn 77, Issue 1, 2011, Pages 91-106

  Fortnow, Lance ^a   Santhanam, Rahul ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Computational complexity; Instance complexity; Kernalization; Probabilistically checkable proof systems

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; HASH FUNCTIONS; POLYNOMIAL APPROXIMATION;

COLLISION-RESISTANT HASH FUNCTIONS; INSTANCE COMPLEXITY; INSTANCE COMPRESSION; KERNALIZATION; ONE-WAY FUNCTIONS; POLYNOMIAL-TIME HIERARCHY; PROBABILISTIC VARIANT; PROBABILISTICALLY CHECKABLE PROOF;

INTEGER PROGRAMMING;

EID: 78349307386     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.06.007     Document Type: Article

References (33)

1. Leonard Adleman, Two theorems on random polynomial time, in: Proceedings of the 20th Annual IEEE Symposium on the Foundations of Computer Science, 1978, pp. 75-83.
2. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy Proof verification and the hardness of approximation problems J. ACM 45 3 1998 501 555
3. Yonatan Aumann, Michael Rabin, Information theoretically secure communication in the limited storage space model, in: Proceedings of CRYPTO '99, 1999, pp. 65-79.
4. Sanjeev Arora, and Shmuel Safra Probabilistic checking of proofs: A new characterization of NP J. ACM 45 1 1998 70 122
5. Noga Alon, and Joel Spencer The Probabilistic Method Third edition Wiley-Intersci. Ser. Discrete Math. Optim. 2008 Wiley
6. Hans Bodlaender, Rod Downey, Michael Fellows, Danny Hermelin, On problems without polynomial kernels, in: Proceedings of 35th International Colloquium on Automata, Languages and Programming, 2008, pp. 563-574.
7. Harry Buhrman, John Hitchcock, NP-complete sets are exponentially dense unless NP ⊆ co-NP/poly, in: Proceedings of 23rd Annual IEEE Conference on Computational Complexity, 2008, in press.
8. Liming Cai, Jianer Chen, Rodney Downey, and Michael Fellows Advice classes of parameterized tractability Ann. Pure Appl. Logic 84 1 1997 119 138
9. Yijia Chen, Jörg Flum, Moritz Müller, Lower bounds for kernelizations and other preprocessing procedures, in: Proceedings of Computability in Europe 2009, in: Lecture Notes in Comput. Sci., Springer-Verlag, 2009, in press.
10. Stephen Cook, The complexity of theorem-proving procedures, in: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.
11. Rodney Downey, and Michael Fellows Parameterized Complexity 1999 Springer-Verlag
12. Bella Dubrov, Yuval Ishai, On the randomness complexity of efficient sampling, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 711-720.
13. Irit Dinur The PCP theorem by gap amplification J. ACM 54 3 2007
14. Yan Zong Ding, Michael Rabin, Hyper-encryption, everlasting security, in: Annual Symposium on Theoretical Aspects of Computer Science, 2002, pp. 1-26.
15. Jorg Flum, and Martin Grohe Parameterized Complexity Theory 2006 Springer
16. L. Fortnow, and R. Santhanam Infeasibility of instance compression and succinct PCPs for NP Proceedings of the 40th ACM Symposium on the Theory of Computing 2008 ACM New York 133 142
17. Michael Garey, and David Johnson Approximation Algorithms for Combinatorial Problems: An Annotated Bibliography 1976 Academic Press New York pp. 41-52
18. Jiong Guo, and Rolf Niedermeier Invitation to data reduction and problem kernelization ACM SIGACT News 38 1 2007 31 45
19. Danny Harnik, Moni Naor, On everlasting security in the hybrid bounded storage model, in: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, 2006, pp. 192-203.
20. Danny Harnik, Moni Naor, On the compressibility of NP instances and cryptographic applications, in: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, pp. 719-728.
21. Russell Impagliazzo, Avi 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, 1997 pp. 220-229.
22. Richard Karp, and Richard Lipton Turing machines that take advice Enseign. Math. 28 2 1982 191 209
23. Yael Tauman Kalai, and Ran Raz Interactive PCP Electronic Colloquium on Computational Complexity 7 31 2007
24. Adam Klivans, and Dieter van Melkebeek Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses SIAM J. Comput. 31 5 2002 1501 1526
25. Stephen Mahaney Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis J. Comput. System Sci. 25 2 1982 130 143
26. Daniel Márx, Parameterized complexity and approximation algorithms, The Computer Journal (2006), in press.
27. Ueli Maurer Conditionally-perfect secrecy and a provably-secure randomized cipher J. Cryptology 5 1 1992 53 66
28. Rolf Niedermeier Invitation to Fixed-Parameter Algorithms 2006 University Press Oxford
29. Daniel 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 Comput. Sci. vol. 1403 1998 334 345
30. Ronen Shaltiel, Christopher 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.
31. Salil Vadhan Constructing locally computable extractors and cryptosystems in the bounded storage model J. Cryptology 17 1 2004 43 77
32. Dieter van Melkebeek, Personal communication, 2009.
33. Chee-Keng Yap Some consequences of non-uniform conditions on uniform classes Theoret. Comput. Sci. 26 1983 287 300