On promise problems: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3895 LNCS, Issue , 2006, Pages 254-290

  Goldreich, Oded ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MORPHOLOGY; NUMERICAL METHODS; THEOREM PROVING;

COMPLETE PROBLEMS; COMPUTATIONAL RESOURCES; GAP PROBLEMS; PROBLEM FORMULATION;

PROBLEM SOLVING;

EID: 37149018236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11685654_12     Document Type: Review

References (75)

1. L. Adleman. Two theorems on random polynomial-time. In 19th FOCS, pages 75-83, 1978.
2. D. Aharonov and O. Regev. Lattice problems in MP ∩ coNP. In 45th FOCS, pages 362-371, 2004.
3. W. Aiello and J. Håstad. Statistical zero-knowledge languages can be recognized in two rounds. JCSS, Vol. 42 (3), pages 327-345, 1991. Preliminary version in 28th FOCS, 1987.
4. N. Alon and R. Boppana. The monotone circuit complexity of Boolean functions. Combinatorica, Vol. 7 (1), pages 1-22, 1987.
5. N. Alon and A. Shapira. A Separation Theorem in Property Testing. Unpublished manuscript, 2004.
6. B. Barak. A Probabilistic-Time Hierarchy Theorem for "Slightly Nonuniform" Algorithms. In Random'02, LNCS 2483, pages 194-208, 2002.
7. M. Bellare, O. Goldreich and M. Sudan. Free Bits, PCPs and Non-Approximability - Towards Tight Results. SICOMP, Vol. 27, No. 3, pages 804-915, 1998. Extended abstract in 36th FOCS, pages 422-431, 1995.
8. C.H. Bennett, G. Brassard and J.M. Robert. Privacy Amplification by Public Discussion. SICOMP, Vol. 17, pages 210-229, 1988.
9. Preliminary version in CRYPTO'85, Springer-Verlag LNCS Vol. 218, pages 468-476 (titled "How to Reduce your Enemy's Information").
10. E. Ben-Sasson, M. Sudan, S. Vadhan and A. Wigderson. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In 35th STOC, pages 612-621, 2003.
11. H. Buhrman and L. Fortnow. One-sided versus two-sided randomness. In Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science. LNCS, Springer, Berlin, 1999.
12. J. Cai and A. Nerurkar. A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. IPL, Vol. 76, pages 61-66, 2000. See comment in [21].
13. L. Carter and M. Wegman. Universal Hash Functions. JCSS, Vol. 18, 1979, pages 143-154.
14. S. Even, A.L. Selman, and Y. Yacobi. The Complexity of Promise Problems with Applications to Public-Key Cryptography. Inform. and Control, Vol. 61, pages 159-173, 1984.
15. S. Even and Y. Yacobi. Cryptography and NP-Completeness. In proceedings of 7th ICALP, Springer-Verlag, LNCS Vol. 85, pages 195-207, 1980. See [13].
16. L. Fortnow, The complexity of perfect zero-knowledge. In Advances in Computing Research, Vol. 5 (S. Micali, ed.), JAC Press Inc., pages 327-343, 1989.
17. Preliminary version in 19th STOC, 1987.
18. L. Fortnow and R. Santhanam. Hierarchy theorems for probabilistic polynomial time. In 45th FOCS, pages 316-324, 2004.
19. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
20. C. Glasser, A.L. Selman, and L. Zhang. Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems. This volume.
21. O. Goldreich. Foundation of Cryptography - Basic Tools. Cambridge University Press, 2001.
22. O. Goldreich. Zero-Knowledge twenty years after its invention. Quaderni di Matemática, Vol. 13 (Complexity of Computations and Proofs, ed. J. Krajicek), pages 249-304, 2004. Available from http://www.wisdom.weizmann.ac.il/~oded/zk-tut02.html.
23. O. Goldreich. Comments regarding [22] at web-page http://www.wisdom. weizmann.ac.il/~oded/p_1p.html.
24. O. Goldreich and S. Goldwasser, On the Limits of Non-Approximability of Lattice Problems. JCSS, Vol. 60, pages 540-563, 2000.
25. Extended abstract in 30th STOC, 1998.
26. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, pages 653-750, July 1998.
27. Extended abstract in 37th FOCS, 1996.
28. O. Goldreich and E. Kushilevitz. A Perfect Zero-Knowledge Proof for a Decision Problem Equivalent to Discrete Logarithm. Jour. of Crypto., Vol. 6 (2), pages 97-116, 1993.
29. Extended abstract in proceedings of Crypto'88.
30. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing but their Validity or AU Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38, No. 1, pages 691-729, 1991.
31. Preliminary version in 27th FOCS, 1986.
32. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, pages 302-343, 2002.
33. Extended abstract in 29th STOC, 1997.
34. O. Goldreich and D. Ron. A sublinear bipartite tester for bounded degree graphs. Combinatorica, 19(3):335-373, 1999.
35. Extended abstract in 30th STOC, 1998.
36. O. Goldreich, A. Sahai, and S. Vadhan. Honest-Verifier Statistical Zero-Knowledge equals general Statistical Zero-Knowledge. In 30th STOC, pages 399-408, 1998.
37. O. Goldreich, A. Sahai, and S. Vadhan. Can Statistical Zero-Knowledge be Made Non-Interactive? or On the Relationship of SZK and NISZK. In Proceedings of Crypto99, Springer LNCS Vol. 1666, pages 467-484.
38. O. Goldreich and M. Sudan. Locally Testable Codes and PCPs of AlmostLinear Length. Preliminary version in 43rd FOCS, 2002. ECCC Report TR02-050, 2002.
39. O. Goldreich and S. Vadhan. Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK. In 14th IEEE Conference on Computational Complexity, pages 54-73, 1999.
40. O. Goldreich and D. Zuckerman. Another proof that BPP subseteq PH (and more). ECCC Report TR97-045, 1997.
41. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, Vol. 18, pages 186-208, 1989.
42. Preliminary version in 17th STOC, 1985.
43. J. Grollmann and A.L. Selman. Complexity Measures for Public-Key Cryptosystems. SIAM Jour, on Comput., Vol. 17 (2), pages 309-335, 1988.
44. 1-ε. Acta Mathematica, Vol. 182, pages 105-142, 1999.
45. Preliminary versions in 28th STOC (1996) and 37th FOCS (1996).
46. J. Hastad. Getting optimal in-approximability results. In 29th STOC, pages 1-10, 1997.
47. R. Impagliazzo, L.A. Levin and M. Luby. Pseudorandom Generation from One-Way Functions. In 21st STOC, pages 12-24, 1989.
48. M. Karchmer and A. Wigderson. Monotone Circuits for Connectivity Require Super-logarithmic Depth. SIAM J. Discrete Math., Vol. 3 (2), pages 255-265, 1990.
49. Preliminary version in 20th STOC, 1988.
50. E. Knill. Quantum randomness and nondeterminism. quant-ph/9610012, 1996.
51. A.Yu. Kitaev, A.H. Shen and M.N. Vyalyi. Classical and Quantum Computation. Vol. 47 of Graduate Studies in Mathematics, AMS, 2002.
52. T. Kuhn. The Structure of Scientific Revolution. University of Chicago, 1962.
53. C. Lautemann. BPP and the Polynomial Hierarchy. IPL, 17, pages 215-217, 1983.
54. A. Lempel. Cryptography in Transition. Computing Surveys, Dec. 1979.
55. N. Nisan and A. Wigderson. A note on Rank versus Communication Complexity. Combinatorica, Vol. 15 (4), pages 557-566, 1995.
56. T. Okamoto. On relationships between statistical zero-knowledge proofs. JCSS, Vol. 60 (1), pages 47-108, 2000.
57. Preliminary version in 28th STOC, 1996.
58. R. Raz. Exponential Separation of Quantum and Classical Communication Complexity. In 31st STOC, pages 358-367, 1999.
59. A. Razborov. Lower bounds for the monotone complexity of some Boolean functions. In Doklady Akademii Nauk SSSR, Vol. 281, No. 4, 1985, pages 798-801.
60. English translation in Soviet Math. Doklady, 31:354-357, 1985.
61. A. Razborov. Lower bounds of monotone complexity of the logical permanent function. Matematicheskie Zametki, Vol. 37, No. 6, 1985, pages 887-900.
62. English translation in Mathematical Notes of the Academy of Sci. of the USSR, 37:485-493, 1985.
63. A. Razborov. On the Distributional Complexity of Disjointness. Theoretical Computer Science, Vol. 106, pages 385-390, 1992.
64. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2), pages 252-271, 1996.
65. A. Sahai and S. Vadhan. A complete problem for Statistical Zero-Knowledge. Journal of the ACM, 50(2)-.196-249, March 2003.
66. Preliminary version in 38th FOCS, 1997.
67. M. Sipser. A Complexity Theoretic Approach to Randomness. In 15th STOC, pages 330-335, 1983.
68. L. Stockmeyer. On Approximation Algorithms for #P. SIAM Journal on Computing, Vol. 14 (4), pages 849-861, 1985.
69. Preliminary version in 15th STOC, pages 118-126, 1983.
70. E. Tardos. The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica, Vol. 8 (1), pages 141-142, 1988.
71. S. Vadhan. A Study of Statistical Zero-Knowledge Proofs. PhD Thesis, Department of Mathematics, MIT, 1999. Available from http://www.eecs.harvard. edu/~salil/papers/phdthesis-abs.html.
72. S. Vadhan. An Unconditional Study of Computational Zero Knowledge. In 45th FOCS, pages 176-185, 2004.
73. S. Vadhan. Using promise problems to define modified complexity classes. Email to the author (Jan. 24, 2005).
74. L.G. Valiant and V.V. Vazirani. NP is as Easy as Detecting Unique Solutions. Theoretical Computer Science, Vol. 47 (1), pages 85-93, 1986.
75. Preliminary version in 17th STOC, pages 458-463, 1985.