New limits to classical and quantum instance compression

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 609-618

  Drucker, Andrew ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

instance compression; kernelization; polynomial hierarchy; quantum compression

Indexed keywords

BOOLEAN FORMULAE; COMPRESSION SCHEME; HARD DECISIONS; INFORMATION BOTTLENECK; INSTANCE COMPRESSION; KERNELIZATION; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME; POLYNOMIAL-TIME REDUCTION; PROOF SYSTEM; QUANTUM STATE; TECHNICAL TOOLS; ZERO KNOWLEDGE PROOF;

COMPUTER SCIENCE; POLYNOMIALS;

BOOLEAN ALGEBRA;

EID: 84871978983     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.71     Document Type: Conference Paper

References (34)

1. R. G. Downey and M. Fellows, Parametrized Complexity, 1st ed. Springer (Monographs in Computer Science), 1999.
2. J. Guo and R. Niedermeier, "Invitation to data reduction and problem kernelization," SIGACT News, vol. 38, no. 1, pp. 31-45, 2007.
3. D. Harnik and M. Naor, "On the compressibility of NP instances and cryptographic applications," SIAM J. Comput., vol. 39, no. 5, pp. 1667-1713, 2010.
4. L. Fortnow and R. Santhanam, "Infeasibility of instance compression and succinct PCPs for NP," J. Comput. Syst. Sci., vol. 77, no. 1, pp. 91-106, 2011.
5. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, "On problems without polynomial kernels," J. Comput. Syst. Sci., vol. 75, no. 8, pp. 423-434, 2009.
6. H. L. Bodlaender, B. M. P. Jansen, and S. Kratsch, "Cross- composition: A new technique for kernelization lower bounds," in STACS, 2011, pp. 165-176.
7. M. Dom, D. Lokshtanov, and S. Saurabh, "Incompressibility through colors and IDs," in 36th ICALP, 2009, pp. 378-389.
8. H. Dell and D. van Melkebeek, "Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses," in 42nd ACM STOC, 2010, pp. 251-260.
9. H. L. Bodlaender, S. Thomassé, and A. Yeo, "Kernel bounds for disjoint cycles and disjoint paths," Theor. Comput. Sci., vol. 412, no. 35, pp. 4570-4578, 2011.
10. H. L. Bodlaender, B. M. P. Jansen, and S. Kratsch, "Kernel bounds for path and cycle problems," in IPEC, 2011, pp. 145-158.
11. -, "Preprocessing for treewidth: A combinatorial analysis through kernelization," in 38th ICALP, 2011, pp. 437-448.
12. Y. Chen, J. Flum, and M. Müller, "Lower bounds for kernelizations and other preprocessing procedures," Theory Comput. Syst., vol. 48, no. 4, pp. 803-839, 2011.
13. D. Hermelin and X. Wu, "Weak compositions and their applications to polynomial lower bounds for kernelization," in 23rd ACM-SIAM SODA, 2012, pp. 104-113.
14. H. Dell and D. Marx, "Kernelization of packing problems," in 23rd ACM-SIAM SODA, 2012, pp. 68-81.
15. S. Kratsch, "Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem," in 23rd ACM-SIAM SODA, 2012, pp. 114-122.
16. H. Buhrman and J. M. Hitchcock, "NP-hard sets are exponentially dense unless coNP ⊆ NP/poly," in 23rd IEEE Conference on Computational Complexity, 2008, pp. 1-7.
17. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge University Press, 2000.
18. J. Watrous, "PSPACE has constant-round quantum interactive proof systems," Theor. Comput. Sci., vol. 292, no. 3, pp. 575-588, 2003.
19. R. Jain, Z. Ji, S. Upadhyay, and J. Watrous, "QIP = PSPACE," J. ACM, vol. 58, no. 6, p. 30, 2011.
20. A. Sahai and S. P. Vadhan, "A complete problem for statistical zero knowledge," J. ACM, vol. 50, no. 2, pp. 196-249, 2003.
21. O. Regev, "Entropy-based bounds on dimension reduction in L1," 2011, arXiv:1108.1283v3.
22. A. A. Fedotov, P. Harremoës, and F. Topsøe, "Refinements of pinsker's inequality," IEEE Transactions on Information Theory, vol. 49, no. 6, pp. 1491-1498, 2003.
23. M. D. Reid and R. C. Williamson, "Generalised pinsker inequalities," in COLT, 2009.
24. R. Raz, "A parallel repetition theorem," SIAM J. Comput., vol. 27, no. 3, pp. 763-803, 1998.
25. H. Klauck, A. Nayak, A. Ta-Shma, and D. Zuckerman, "Interaction in quantum communication," IEEE Transactions on Information Theory, vol. 53, no. 6, pp. 1970-1982, 2007.
26. R. J. Lipton and N. E. Young, "Simple strategies for large zero-sum games with applications to complexity theory," in 26th ACM STOC, 1994, pp. 734-740.
27. I. Althöfer, "On sparse approximations to randomized strategies and convex combinations," Linear Algebra and its Applications, vol. 199, Supplement 1, no. 0, pp. 339-355, 1994.
28. A. Nayak, "Optimal lower bounds for quantum automata and random access codes," in 40th IEEE FOCS, 1999, pp. 369-377.
29. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. Wiley-Interscience, 2006.
30. L. M. Adleman, "Two theorems on random polynomial time," in 19th IEEE FOCS, 1978, pp. 75-83.
31. L. Fortnow, "The complexity of perfect zero-knowledge (extended abstract)," in 19th ACM STOC, A. V. Aho, Ed., 1987, pp. 204-209.
32. W. Aiello and J. Håstad, "Statistical zero-knowledge languages can be recognized in two rounds," J. Comput. Syst. Sci., vol. 42, no. 3, pp. 327-345, 1991.
33. T. Okamoto, "On relationships between statistical zeroknowledge proofs," J. Comput. Syst. Sci., vol. 60, no. 1, pp. 47-108, 2000.
34. O. Goldreich and S. P. Vadhan, "On the complexity of computational problems regarding distributions (a survey)," Electronic Colloquium on Computational Complexity (ECCC), vol. TR11-004, p. 4, 2011.