Average-case complexity

Foundations and Trends in Theoretical Computer Science

Volumn 2, Issue 1, 2006, Pages 1-106

  Bogdanov, Andrej ^a   Trevisan, Luca ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; PROBABILITY DISTRIBUTIONS; SAMPLING;

AVERAGE-CASE COMPLEXITY; GOOD-ON-AVERAGE ALGORITHMS; HARD-ON-AVERAGE PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 34047176921     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000004     Document Type: Article

References (76)

1. D. Achlioptas and C. Moore, "The asymptotic order of the k-SAT threshold," in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 779-788, 2002.
2. klog2 - O(k)," Journal of the AMS, vol. 17, no. 4, pp. 947-973, 2004.
3. L. Adleman, '"Two theorems on random polynomial time," in Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pp. 75-83, 1978.
4. D. Aharonov and O. Regev, "Lattice Problems in NP∩coNP," Journal of the ACM, vol. 52, no. 5, pp. 749-765, Preliminary version in Proceedings of FOCS 2004, 2005.
5. M. Ajtai, "Generating hard instances of lattice problems," in Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 99-108, 1996.
6. 2 is NP-hard for Randomized Reductions," in Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 10-19, 1998.
7. M. Ajtai and C. Dwork, "A Public-Key Cryptosystem with Worst-Case/ Average-Case Equivalence," in Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 284-293, 1997.
8. M. Ajtai, R. Kumar, and D. Sivakumar, "A sieve algorithm for the shortest lattice vector problem," in Proceedings of the 33rd ACM Symposium on Theory of Computing, pp. 601-610, 2001.
9. A. Akavia, O. Goldreich, S. Goldwasser, and D. Moshkovitz, "On basing one-way functions on NP-hardness," in Proceedings of the 38th ACM Symposium on Theory of Computing, 2006.
10. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, "BPP has subexponential time simulations unless EXPTIME has publishable proofs," Computational Complexity, vol. 3, no. 4, pp. 307-318, 1993.
11. P. Beame, R. Karp, T. Pitassi, and M. Saks, "On the complexity of unsatisfiability proofs for random k-CNF formulas," in Proceedings of the 30th ACM Symposium on Theory of Computing, 1998.
12. S. Ben-David, B. Chor, O. Goldreich, and M. Luby, "On the theory of average case complexity," Journal of Computer and System Sciences, vol. 44, no. 2, pp. 193-219, 1992.
13. E. Ben-Sasson and A. Wigderson, "Short proofs are narrow: Resolution made simple," Journal of the ACM, vol. 48, no. 2, 2001.
14. M. Blum and S. Micali, "How to generate cryptographically strong sequences of pseudorandom bits," SIAM Journal on Computing, vol. 13, no. 4, pp. 850-864, Preliminary version in Proceedings of FOCS'82, 1984.
15. A. Bogdanov and L. Trevisan, "On wosrt-case to average-case reductions for NP problems," in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pp. 308-317, 2003.
16. D. Boneh and R. J. Lipton, "Amplification of weak learning under the uniform distribution," in Proceedings of the 6th ACM Conference on Computational Learning Theory, pp. 347-351, 1993.
17. G. Brassard, "Relativized cryptography," in Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pp. 383-391, 1979.
18. V. Chvatal and E. Szemeredi, "Many hard examples for resolution," Journal of the ACM, vol. 35, no. 4, pp. 759-768, 1998.
19. A. Coja-Oghlan, A. Goerdt, A. Lanka, and F. Schdlich, "Certifying unsatisfiability of random 2k-SAT formulas using approximation techniques," in Proceedings of 14th Symposium on Foundations of Computation Theory, pp. 15-26, LNCS 2751, 2003.
20. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644-654, 1976.
21. S. Even, A. Selman, and Y. Yacobi, "The complexity of promise problems with applications to public-key cryptography," Information and Computation, vol. 61, no. 2, pp. 159-173, 1984.
22. S. Even and Y. Yacobi, "Cryptography and NP-completeness," in Proceedings of the 7th International Colloquium on Automata, Languages and Programming, pp. 195-207, Springer-Verlag, 1980.
23. U. Feige, "Relations between average case complexity and approximation complexity," in Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 534-543, 2002.
24. U. Feige, J. Kim, and E. Ofek, "Witnesses for non-satisfiability of dense random 3CNF formulas," in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, 2006. To appear.
25. U. Feige and E. Ofek, "Easily refutable subformulas of random 3CNF formulas," in Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp. 519-530, 2004.
26. U. Feige and E. Ofek, "Random 3CNF formulas elude the Lovasz theta function," Tech. Rep. TR06-043, Electronic Colloquium on Computational Complexity, 2006.
27. J. Feigenbaum and L. Fortnow, "Random-self-reducibility of complete sets," SIAM Journal on Computing, vol. 22, pp. 994-1005, 1993.
28. E. Friedgut, "Necessary and sufficient conditions for sharp thresholds of graph properties and the k-SAT problem," Journal of the AMS, vol. 12, pp. 1017-1054, 1999.
29. A. Goerdt and M. Krivelevich, "Efficient recognition of random unsatisfiable k-SAT instances by spectral methods," in Proceedings of the 18th Symposium on Theoretical Aspects of Computer Science, pp. 294-304, 2001.
30. O. Goldreich and S. Goldwasser, "On the limits of non-approximability of lattice problems," in Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 1-9, 1998.
31. O. Goldreich, The Foundations of Cryptography - Volume 1. Cambridge University Press, 2001.
32. O. Goldreich, "On promise problems (a survey in memory of Shimon Even [1935-2004])," Tech. Rep. TR05-018, Electronic Colloquium on Computational Complexity, 2005.
33. O. Goldreich and S. Goldwasser, "On the possibility of basing Cryptography on the assumption that P ≠ NP," 1998. Unpublished manuscript.
34. O. Goldreich, N. Nisan, and A. Wigderson, "On Yao's XOR Lemma," Tech. Rep. TR95-50, Electronic Colloquium on Computational Complexity, 1995.
35. S. Goldwasser and S. Micali, "Probabilistic encryption," Journal of Computer and System Sciences, vol. 28, no. 2, pp. 270-299, Preliminary Version in Proceedings of STOC'82, 1984.
36. D. Gutfreund, R. Shaltiel, and A. Ta-Shma, "If NP languages are hard on the worst-case then it is easy to find their hard instances," in Proceedings of the 20th IEEE Conference on Computational Complexity, 2005.
37. D. Gutfreund and A. Ta-Shma, "New connections between derandomization, worst-case complexity and average-case complexity," Tech. Rep. TR06-108, Electronic Colloquium on Computational Complexity, 2006.
38. J. Håstad, "Some optimal inapproximability results," Journal of the ACM, vol. 48, no. 4, pp. 798-859, 2001.
39. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby, "A pseudorandom generator from any one-way function," SIAM Journal on Computing, vol. 28, no. 4, pp. 1364-1396, 1999.
40. A. Healy, S. Vadhan, and E. Viola, "Using nondeterminism to amplify hardness," in Proceedings of the 36th ACM Symposium on Theory of Computing, pp. 192-201, 2004.
41. R. Impagliazzo, "Hard-core distributions for somewhat hard problems," in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pp. 538-545, 1995.
42. R. Impagliazzo and L. Levin, "No Better Ways to Generate Hard NP Instances than Pickling Uniformly at Random," in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pp. 812-821, 1990.
43. R. Impagliazzo and M. Luby, "One-way Functions are Essential for Complexity Based Cryptography," in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pp. 230-235, 1989.
44. R. Impagliazzo and A. Wigderson, "P = BPP unless E has sub-exponential circuits," in Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 220-229, 1997.
45. V. Kabanets, "Derandomization: A brief overview," Bulletin of the European Association for Theoretical Computer Science, vol. 76, pp. 88-103, 2002.
46. R. Karp, "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane," Mathematics of Operations Research, vol. 2, no. 3, pp. 209-224, 1977.
47. R. Karp, J. Lenstra, C. McDiarmid, and A. R. Kan, "Probabilistic analysis," in Combinatorial Optimization: An Annotated Bibliography, (M. O'hEigeartaigh, J. Lenstra, and A. R. Kan, eds.), pp. 52-88, Wiley, 1985.
48. S. Khot, "Hardness of approximating the shortest vector problem in lattices," 2004. Manuscript.
49. D. Knuth, The Art of Computer Programming. Vol. 3, Addison-Wesley, 1973.
50. R. Kumar and D. Sivakumar, "On polynomial-factor approximations to the shortest lattice vector length," SIAM Journal on Discrete Mathematics, vol. 16, no. 3, pp. 422-425, Preliminary version in Proceedings of SODA 2001, 2003.
51. A. Lempel, "Cryptography in transition," Computing Surveys, vol. 11, no. 4, pp. 215-220, 1979.
52. A. Lenstra, H. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515-534, 1982.
53. L. Levin, "Average case complete problems," SIAM Journal on Computing, vol. 15,no. 1, pp. 285-286, 1986.
54. L. Levin, "One-Way Functions and Pseudorandom Generators," Combinatorica, vol. 7, no. 4, pp. 357-363, 1987.
55. M. Li and P. M. B. Vitányi, "Average case complexity under the universal distribution equals worst-case complexity," IPL, vol. 42, no. 3, pp. 145-149, 1992.
56. D. Micciancio, "The shortest vector problem is NP-hard to approximate to within some constant," SIAM Journal on Computing, vol. 30, no. 6, pp. 2008-2035, 2001.
57. D. Micciancio, "Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor," SIAM Journal on Computing, vol. 34, no. 1, pp. 118-169, 2004.
58. D. Micciancio and S. Goldwasser, Complexity of Lattice Problems. Norwell, MA, USA: Kluwer Academic Publishers, 2002.
59. D. Micciancio and O. Regev, "Worst-case to average-case reductions based on gaussian measure," in Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 372-381, 2004.
60. N. Nisan and A. Wigderson, "Hardness vs randomness," Journal of Computer and System Sciences, vol. 49, pp. 149-167, Preliminary version in Proc. of FOCS'88, 1994.
61. R. O'Donnell, "Hardness amplification within NP," in Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 751-760, 2002.
62. R. Ostrovsky, "One-way functions, hard on average problems and statistical zero-knowledge proofs," in STRUCTURES91, pp. 51-59, 1991.
63. O. Regev, "New lattice based cryptographic constructions," in Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 407-416, 2003.
64. O. Regev, "On lattices, learning with errors, random linear codes, and cryptography," in Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 84-93, 2005.
65. O. Regev, "Lattice-based cryptography," in Advances in Cryptology (CRYPTO), pp. 131-141, 2006.
66. O. Regev and R. Rosen, "Lattice problems and norm embeddings," in Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 447-456, 2006.
67. C. Schnorr, "A hierarchy of polynomial time lattice basis reduction algorithms," Theoretical Computer Science, vol. 53, pp. 201-224, 1987.
68. A. Shamir, "On the cryptocomplexity of knapsack systems," in Proceedings of the 11th ACM Symposium on Theory of Computing, pp. 118-129, 1979.
69. M. Sudan, L. Trevisan, and S. Vadhan, "Pseudorandom generators without the XOR Lemma," Journal of Computer and System Sciences, vol. 62, no. 2, pp. 236-266, 2001.
70. L. Trevisan, "List-decoding using the XOR Lemma," in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pp. 126-135, 2003.
71. L. Trevisan, "Some Applications of coding theory in computational complexity," Quaderni di Matematica, vol. 13, pp. 347-424, arXiv:cs.CC/0409044, 2004.
72. L. Trevisan, "On uniform amplification of hardness in NP," in Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 31-38, 2005.
73. L. G. Valiant and V. V. Vazirani, "NP is as easy as detecting unique solutions," Theoretical Computer Science, vol. 47, pp. 85-93, 1986.
74. E. Viola, "The Complexity of constructing pseudorandom generators from hard functions," Computational Complexity, vol. 13, no. 3-4, pp. 147-188, 2004.
75. E. Viola, "On Constructing Parallel Pseudorandom Generators from One-Way Functions," in Proceedings of the 20th IEEE Conference on Computational Complexity, 2005.
76. A. C. Yao, "Theory and applications of trapdoor functions," in Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, pp. 80-91, 1982.