Computational complexity: A conceptual perspective

Computational Complexity: A Conceptual Perspective

Volumn 9780521884730, Issue , 2008, Pages 1-606

  Goldreich, Oded ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

STUDENTS;

COMPLEXITY THEORY; COMPUTATIONAL RESOURCES; GRADUATE STUDENTS; HARDNESS AMPLIFICATION; PROOF SYSTEM; PSEUDORANDOMNESS; SUB-AREAS; THEORETICAL FOUNDATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 84924435299     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511804106     Document Type: Book

References (244)

1. S. Aaronson. Complexity Zoo. A continueously updated Web site at http://qwiki.caltech.edu/wiki/ComplexityZoo/.
2. L. M. Adleman and M. Huang. Primality Testing and Abelian Varieties Over Finite Fields. Springer-Verlag Lecture Notes in Computer Science (Vol. 1512), 1992. Preliminary version in 19th STOC, 1987.
3. M. Agrawal, N. Kayal, and N. Saxena. PRIMES Is in P. Annals of Mathematics, Vol. 160 (2), pages 781–793, 2004.
4. M. Ajtai, J. Komlos, and E. Szemerédi. Deterministic Simulation in LogSpace. In 19th ACM Symposium on the Theory of Computing, pages 132–140, 1987.
5. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. RandomWalks, Universal Traversal Sequences, and the Complexity of Maze Problems. In 20th IEEE Symposium on Foundations of Computer Science, pages 218–223, 1979.
6. N. Alon, L. Babai, and A. Itai. A Fast and Simple Randomized Algorithm for the Maximal Independent Set Problem. J. of Algorithms, Vol. 7, pages 567–583, 1986.
7. N. Alon and R. Boppana. The Monotone Circuit Complexity of Boolean Functions. Combinatorica, Vol. 7 (1), pages 1–22, 1987.
8. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth. Construction of Asymptotically Good, Low-Rate Error-Correcting Codes Through Pseudo-Random Graphs. IEEE Transactions on Information Theory, Vol. 38, pages 509–516, 1992.
9. N. Alon, E. Fischer, I. Newman, and A. Shapira. A Combinatorial Characterization of the Testable Graph Properties: It’s All About Regularity. In 38th ACM Symposium on the Theory of Computing, pages 251–260, 2006.
10. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple Constructions of Almost k-wise Independent Random Variables. Journal of Random Structures and Algorithms, Vol. 3 (3), pages 289–304, 1992. Preliminary version in 31st FOCS, 1990.
11. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley & Sons, 1992. Second edition 2000.
12. R. Armoni. On the Derandomization of Space-Bounded Computations. In the proceedings of Random 98, Springer-Verlag Lecture Notes in Computer Science (Vol. 1518), pages 49–57, 1998.
13. S. Arora. Approximation Schemes for NP-Hard Geometric Optimization Problems: A Survey. Math. Programming, Vol. 97, pages 43–69, July 2003.
14. S. Arora and B. Barak. Complexity Theory: A Modern Approach. Cambridge University Press, forthcoming.
15. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof Verification and Intractability of Approximation Problems. Journal of the ACM, Vol. 45, pages 501–555, 1998. Preliminary version in 33rd FOCS, 1992.
16. S. Arora and S. Safra. Probabilistic Checkable Proofs: A New Characterization of NP. Journal of the ACM, Vol. 45, pages 70–122, 1998. Preliminary version in 33rd FOCS, 1992.
17. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, 1998.
18. L. Babai. Trading Group Theory for Randomness. In 17th ACM Symposium on the Theory of Computing, pages 421–429, 1985.
19. L. Babai. Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy. Information Processing Letters, Vol. 26, pages 51–53, 1987.
20. L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking Computations in Polylogarithmic Time. In 23rd ACM Symposium on the Theory of Computing, pages 21–31, 1991.
21. L. Babai, L. Fortnow, and C. Lund. Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols. Computational Complexity, Vol. 1 (1), pages 3–40, 1991. Preliminary version in 31st FOCS, 1990.
22. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP Has Subexponential Time Simulations Unless EXPTIME Has Publishable Proofs. Complexity Theory, Vol. 3, pages 307–318, 1993.
23. L. Babai and S. Moran. Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes. Journal of Computer and System Science, Vol. 36, pages 254–276, 1988.
24. E. Bach and J. Shallit. Algorithmic Number Theory (Volume I: Efficient Algorithms). MIT Press, 1996.
25. B. Barak. Non-Black-Box Techniques in Crypptography. Ph.D. thesis, Weizmann Institute of Science, 2004.
26. W. Baur and V. Strassen. The Complexity of Partial Derivatives. Theor. Comput. Sci. 22, pages 317–330, 1983.
27. P. Beame and T. Pitassi. Propositional Proof Complexity: Past, Present, and Future. In Bulletin of the European Association for Theoretical Computer Science, Vol. 65 (June), pages 66–89, 1998.
28. M. Bellare, O. Goldreich, and E. Petrank. Uniform Generation of NP-Witnesses Using an NP-Oracle. Information and Computation, Vol. 163, pages 510–526, 2000.
29. M. Bellare, O. Goldreich, and M. Sudan. Free Bits, PCPs and Non-Approximability – Towards Tight Results. SIAM Journal on Computing, Vol. 27 (3), pages 804–915, 1998. Extended abstract in 36th FOCS, 1995.
30. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the Theory of Average Case Complexity. Journal of Computer and System Science, Vol. 44 (2), pages 193–219, 1992.
31. A. Ben-Dor and S. Halevi. In 2nd Israel Symp. on Theory of Computing and Systems, IEEE Computer Society Press, pages 108-117, 1993.
32. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Håastad, J. Kilian, S. Micali, and P. Rogaway. Everything Provable Is Probable in Zero-Knowledge. In Crypto88, Springer-Verlag Lecture Notes in Computer Science (Vol. 403), pages 37–56, 1990.
33. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability. In 20th ACM Symposium on the Theory of Computing, pages 113–131, 1988.
34. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation. In 20th ACM Symposium on the Theory of Computing, pages 1–10, 1988.
35. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM Journal on Computing, Vol. 36 (4), pages 889–974, 2006. Extended abstract in 36th STOC, 2004.
36. E. Ben-Sasson and M. Sudan. Simple PCPs with Poly-log Rate and Query Complexity. In 37th ACM Symposium on the Theory of Computing, pages 266–275, 2005.
37. L. Berman and J. Hartmanis. On Isomorphisms and Density of NP and Other Complete Sets. SIAM Journal on Computing, Vol. 6 (2), 1977, pages 305–322.
38. M. Blum. A Machine-Independent Theory of theComplexity of Recursive Functions. Journal of the ACM, Vol. 14 (2), pages 290–305, 1967.
39. M. Blum and S. Kannan. Designing Programs That Check Their Work. In 21st ACM Symposium on the Theory of Computing, pages 86–97, 1989.
40. M. Blum, M. Luby, and R. Rubinfeld. Self-Testing/Correcting with Applications to Numerical Problems. Journal of Computer and System Science, Vol. 47 (3), pages 549–595, 1993.
41. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo- Random Bits. SIAM Journal on Computing, Vol. 13, pages 850–864, 1984. Preliminary version in 23rd FOCS, 1982.
42. A. Bogdanov, K. Obata, and L. Trevisan. A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. In 43rd IEEE Symposium on Foundations of Computer Science, pages 93–102, 2002.
43. A. Bogdanov and L. Trevisan. OnWorst-Case to Average-Case Reductions for NP Problems. SIAM Journal on Computing, Vol. 36 (4), pages 1119–1159, 2006. Extended abstract in 44th FOCS, 2003.
44. A. Bogdanov and L. Trevisan. Average-Case Complexity. Foundations and Trends in Theoretical Computer Science, Vol. 2 (1), 2006.
45. R. Boppana, J. Håstad, and S. Zachos. Does Co-NP Have Short Interactive Proofs? Information Processing Letters, Vol. 25 (May), pages 127–132, 1987.
46. R. Boppana and M. Sipser. The Complexity of Finite Functions. In Handbook of Theoretical Computer Science: Volume A – Algorithms and Complexity, J. van Leeuwen (ed.), MIT Press/Elsevier, pages 757–804, 1990.
47. A. Borodin. Computational Complexity and the Existence of Complexity Gaps. Journal of the ACM, Vol. 19 (1), pages 158–174, 1972.
48. A. Borodin. On Relating Time and Space to Size and Depth. SIAM Journal on Computing, Vol. 6 (4), pages 733–744, 1977.
49. G. Brassard, D. Chaum, and C. Crépeau. Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Science, Vol. 37 (2), pages 156–189, 1988. Preliminary version by Brassard and Crépeau in 27th FOCS, 1986.
50. L. Carter and M. Wegman. Universal Hash Functions. Journal of Computer and System Science, Vol. 18, pages 143–154, 1979.
51. G. J. Chaitin. On the Length of Programs for Computing Finite Binary Sequences. Journal of the ACM, Vol. 13, pages 547–570, 1966.
52. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, Vol. 28, pages 114–133, 1981.
53. D. Chaum, C. Crépeau, and I. Damgård. Multi-party Unconditionally Secure Protocols. In 20th ACM Symposium on the Theory of Computing, pages 11–19, 1988.
54. B. Chor and O. Goldreich. On the Power of Two–Point Based Sampling. Jour. of Complexity, Vol. 5, pages 96–106, 1989. Preliminary version dates 1985.
55. A. Church. An Unsolvable Problem of Elementary Number Theory. Amer. J. of Math., Vol. 58, pages 345–363, 1936.
56. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, 2001.
57. A. Cobham. The Intristic Computational Difficulty of Functions. In Proc. 1964 Iternational Congress for Logic Methodology and Philosophy of Science, pages 24–30, 1964.
58. S. A. Cook. The Complexity of Theorem Proving Procedures. In 3rd ACM Symposium on the Theory of Computing, pages 151–158, 1971.
59. S. A. Cook. An Overview of Computational Complexity. Turing Award Lecture. CACM, Vol. 26 (6), pages 401–408, 1983.
60. S. A. Cook. A Taxonomy of Problems with Fast Parallel Algorithms. Information and Control, Vol. 64, pages 2–22, 1985.
61. S. A. Cook and R. A. Reckhow. The Relative Efficiency of Propositional Proof Systems. J. of Symbolic Logic, Vol. 44 (1), pages 36–50, 1979.
62. D. Coppersmith and S. Winograd. Matrix Multiplication via Arithmetic Progressions. Journal of Symbolic Computation, Vol. 9, pages 251–280, 1990.
63. T. M. Cover and G. A. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.
64. P. Crescenzi and V. Kann. A Compendium of NP Optimization problems. Available at http://www.nada.kth.se/∼viggo/wwwcompendium/
65. R. A. DeMillo and R. J. Lipton. A Probabilistic Remark on Algebraic Program Testing. Information Processing Letters, Vol. 7 (4), pages 193–195, 1978.
66. W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, IT-22 (Nov.), pages 644–654, 1976.
67. I. Dinur. The PCP Theorem by Gap Amplification. In 38th ACM Symposium on the Theory of Computing, pages 241–250, 2006.
68. I. Dinur and O. Reingold. Assignment-Testers: Towards a Combinatorial Proof of the PCPTheorem. SIAM Journal on Computing, Vol. 36 (4), pages 975–1024, 2006. Extended abstract in 45th FOCS, 2004.
69. I. Dinur and S. Safra. The Importance of Being Biased. In 34th ACM Symposium on the Theory of Computing, pages 33–42, 2002.
70. J. Edmonds. Paths, Trees, and Flowers. Canad. J. Math., Vol. 17, pages 449–467, 1965.
71. S. Even. Graph Algorithms. Computer Science Press, 1979.
72. S. Even, A. L. Selman, and Y. Yacobi. The Complexity of Promise Problems with Applications to Public-Key Cryptography. Information and Control, Vol. 61, pages 159–173, 1984.
73. U. Feige, S. Goldwasser, L. Lovász, and S. Safra. On the Complexity of Approximating the Maximum Size of a Clique. Unpublished manuscript, 1990.
74. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Approximating Clique is Almost NP-Complete. Journal of the ACM, Vol. 43, pages 268–292, 1996. Preliminary version in 32nd FOCS, 1991.
75. U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Under General Assumptions. SIAM Journal on Computing, Vol. 29 (1), pages 1–28, 1999. Preliminary version in 31st FOCS, 1990.
76. U. Feige and A. Shamir. Witness In distinguishability and Witness Hiding Protocols. In 22nd ACM Symposium on the Theory of Computing, pages 416–426, 1990.
77. E. Fischer. The Art of Uninformed Decisions: A Primer to Property Testing. Bulletin of the European Association for Theoretical Computer Science, Vol. 75, pages 97–126, 2001.
78. G. D. Forney. Concatenated Codes. MIT Press, 1966.
79. L. Fortnow, R. Lipton, D. van Melkebeek, and A. Viglas. Time-Space Lower Bounds for Satisfiability. Journal of the ACM, Vol. 52 (6), pages 835–865, 2005.
80. L. Fortnow, J. Rompel, and M. Sipser. On the Power of Multi-Prover Interactive Protocols. In 3rd IEEE Symp. on Structure in Complexity Theory, pages 156–161, 1988. See errata in 5th IEEE Symp. on Structure in Complexity Theory, pages 318–319, 1990.
81. S. Fortune. A Note on Sparse Complete Sets. SIAM Journal on Computing, Vol. 8, pages 431–433, 1979.
82. M. Fürer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos. On Completeness and Soundness in Interactive Proof Systems. Advances in Computing Research: A Research Annual, Vol. 5 (Randomness and Computation, S. Micali, ed.), pages 429–442, 1989.
83. M. L. Furst, J. B. Saxe, and M. Sipser. Parity, Circuits, and the Polynomial-Time Hierarchy. Mathematical Systems Theory, Vol. 17 (1), pages 13–27, 1984. Preliminary version in 22nd FOCS, 1981.
84. O. Gabber and Z. Galil. Explicit Constructions of Linear Size Superconcentrators. Journal of Computer and System Science, Vol. 22, pages 407–420, 1981.
85. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
86. J. von zur Gathen. Algebraic Complexity Theory. Ann. Rev. Comput. Sci., Vol. 3, pages 317–347, 1988.
87. O. Goldreich. Foundation of Cryptography – Class Notes. Computer Science Dept., Technion, Israel, Spring 1989. Superseded by [91, 92].
88. O. Goldreich. A Note on Computational Indistinguishability. Information Processing Letters, Vol. 34 (May), pages 277–281, 1990.
89. O. Goldreich. Notes on Levin’s Theory of Average-Case Complexity. ECCC, TR97-058, 1997.
90. O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics Series (Vol. 17), Springer, 1999.
91. O. Goldreich. Foundation of Cryptography: Basic Tools. Cambridge University Press, 2001.
92. O. Goldreich. Foundation of Cryptography: Basic Applications. Cambridge University Press, 2004.
93. O. Goldreich. Short Locally Testable Codes and Proofs (Survey). ECCC, TR05-014, 2005.
94. O. Goldreich. On Promise Problems (a survey in memory of Shimon Even [1935-2004]). ECCC, TR05-018, 2005.
95. O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. Journal of the ACM, Vol. 33 (4), pages 792–807, 1986.
96. O. Goldreich, S. Goldwasser, and A. Nussboim. On the Implementation of Huge Random Objects. In 44th IEEE Symposium on Foundations of Computer Science, pages 68–79, 2003.
97. 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. Extended abstract in 37th FOCS, 1996.
98. O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing, Vol. 25 (1), pages 169–192, 1996. Preliminary version in 17th ICALP, 1990.
99. O. Goldreich and L.A. Levin. Hard-Core Predicates for Any One-Way Function. In 21st ACM Symposium on the Theory of Computing, pages 25–32, 1989.
100. O. Goldreich, S. Micali, and A. Wigderson. Proofs That Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM, Vol. 38 (3), pages 691–729, 1991. Preliminary version in 27th FOCS, 1986.
101. O. Goldreich, S. Micali, and A. Wigderson. Howto Play Any Mental Game –ACompleteness Theorem for Protocols with Honest Majority. In 19th ACM Symposium on the Theory of Computing, pages 218–229, 1987.
102. O. Goldreich, N. Nisan, and A. Wigderson. On Yao’s XOR-Lemma. ECCC, TR95-050, 1995.
103. O. Goldreich and D. Ron. Property Testing in Bounded Degree Graphs. Algorithmica, pages 302–343, 2002. Extended abstract in 29th STOC, 1997.
104. O. Goldreich and D. Ron. A Sublinear Bipartite Tester for Bounded Degree Graphs. Combinatorica, Vol. 19 (3), pages 335–373, 1999. Extended abstract in 30th STOC, 1998.
105. O. Goldreich, R. Rubinfeld, and M. Sudan. Learning Polynomials with Queries: The Highly Noisy Case. SIAM J. Discrete Math., Vol. 13 (4), pages 535–570, 2000.
106. O. Goldreich, S. Vadhan, and A. Wigderson. On Interactive Proofs with a Laconic Provers. Computational Complexity, Vol. 11, pages 1–53, 2002.
107. O. Goldreich and A. Wigderson. Computational Complexity. In The Princeton Companion to Mathematics, forthcoming.
108. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Science, Vol. 28 (2), pages 270–299, 1984. Preliminary version in 14th STOC, 1982.
109. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, Vol. 18, pages 186–208, 1989. Preliminary version in 17th STOC, 1985. Earlier versions date to 1982.
110. S. Goldwasser, S. Micali, and R. L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, Vol. 17, pages 281–308, 1988.
111. S. Goldwasser and M. Sipser. Private CoinsVersus Public Coins in Interactive Proof Systems. Advances in Computing Research: A Research Annual, Vol. 5 (Randomness and Computation, S. Micali, ed.), pages 73–90, 1989. Extended abstract in 18th STOC, 1986.
112. S. W. Golomb. Shift Register Sequences. Holden-Day, 1967. (Aegean Park Press, revised edition, 1982.)
113. V. Guruswami, C. Umans, and S. Vadhan. Unbalanced Expanders andRandomness Extractors from Parvaresh-Vardy Codes. In 22nd IEEE Conference on Computational Complexity, pages 96–108, 2007.
114. J. Hartmanis and R. E. Stearns. On the Computational Complexity of Algorithms. Transactions of the AMS, Vol. 117, pages 285–306, 1965.
115. J. Håastad. Almost Optimal Lower Bounds for Small Depth Circuits. Advances in Computing Research: A Research Annual, Vol. 5 (Randomness and Computation, S. Micali, ed.), pages 143–170, 1989. Extended abstract in 18th STOC, 1986.
116. J. Håastad. Clique Is Hard to Approximate Within n 1-e. Acta Mathematica, Vol. 182, pages 105–142, 1999. Preliminary versions in 28th STOC (1996) and 37th FOCS (1996).
117. J. Håastad. Getting Optimal In-Approximability Results. Journal of the ACM, Vol. 48, pages 798–859, 2001. Extended abstract in 29th STOC, 1997.
118. J. Håastad, R. Impagliazzo, L. A. Levin, and M. Luby. A Pseudorandom Generator from Any One-way Function. SIAM Journal on Computing, Vol. 28 (4), pages 1364–1396, 1999. Preliminary versions by Impagliazzo et al. in 21st STOC (1989) and Håastad in 22nd STOC (1990).
119. J. Håastad and S. Khot. Query Efficient PCPs with Pefect Completeness. In 42nd IEEE Symposium on Foundations of Computer Science, pages 610–619, 2001.
120. A. Healy. Randomness-Efficient SamplingWithin NC1. Computational Complexity, in press. Preliminary version in 10th RANDOM, 2006.
121. A. Healy, S. Vadhan, and E. Viola. Using Nondeterminism to Amplify Hardness. SIAM Journal on Computing, Vol. 35 (4), pages 903–931, 2006.
122. D. Hochbaum (ed.). Approximation Algorithms for NP-Hard Problems. PWS Publishing, 1996.
123. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
124. S. Hoory, N. Linial, and A. Wigderson. Expander Graphs and Their Applications. Bull. AMS, Vol. 43 (4), pages 439–561, 2006.
125. N. Immerman. Nondeterministic Space Is Closed Under Complementation. SIAM Journal on Computing, Vol. 17, pages 760–778, 1988.
126. R. Impagliazzo. Hard-Core Distributions for Somewhat Hard Problems. In 36th IEEE Symposium on Foundations of Computer Science, pages 538–545, 1995.
127. R. Impagliazzo and L.A. Levin. No Better Ways to Generate Hard NP Instances Than Picking Uniformly at Random. In 31st IEEE Symposium on Foundations of Computer Science, pages 812–821, 1990.
128. R. Impagliazzo and A. Wigderson. P = BPP If E Requires Exponential Circuits: Derandomizing the XOR Lemma. In 29th ACM Symposium on the Theory of Computing, pages 220–229, 1997.
129. R. Impagliazzo and A. Wigderson. Randomness vs Time: Derandomization under a Uniform Assumption. Journal of Computer and System Science, Vol. 63 (4), pages 672-688, 2001.
130. R. Impagliazzo andM. Yung. Direct Zero-Knowledge Computations. In Crypto87, Springer- Verlag Lecture Notes in Computer Science (Vol. 293), pages 40–51, 1987.
131. M. Jerrum, A. Sinclair, and E. Vigoda. A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Non-Negative Entries. Journal of the ACM, Vol. 51 (4), pages 671–697, 2004.
132. M. Jerrum, L. Valiant, and V. V. Vazirani. Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science, Vol. 43, pages 169–188, 1986.
133. B. Juba and M. Sudan. Towards Universal Semantic Communication. ECCC, TR07-084, 2007.
134. V. Kabanets and R. Impagliazzo. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Computational Complexity, Vol. 13, pages 1-46, 2004. Preliminary version in 35th STOC, 2003.
135. N. Kahale. Eigenvalues and Expansion of Regular Graphs. Journal of the ACM, Vol. 42 (5), pages 1091–1106, 1995.
136. R. Kannan, H. Venkateswaran, V. Vinay, and A. C. Yao. A Circuit-Based Proof of Toda’s Theorem. Information and Computation, Vol. 104 (2), pages 271–276, 1993.
137. M. Karchmer and A. Wigderson. Monotone Circuits for Connectivity Require Superlogarithmic Depth. SIAM J. Discrete Math., Vol. 3 (2), pages 255–265, 1990. Preliminary version in 20th STOC, 1988.
138. R. M. Karp. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher (eds.), Plenum Press, pages 85–103, 1972.
139. R. M. Karp and R. J. Lipton. Some Connections Between Nonuniform and Uniform Complexity Classes. In 12th ACM Symposium on the Theory of Computing, pages 302–309, 1980.
140. R. M. Karp andM. Luby. Monte-Carlo Algorithms for Enumeration and Reliability Problems. In 24th IEEE Symposium on Foundations of Computer Science, pages 56-64, 1983.
141. R. M. Karp and V. Ramachandran. Parallel Algorithms for Shared-Memory Machines. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, J. van Leeuwen (ed.), MIT Press/Elsevier, pages 869–942, 1990.
142. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
143. S. Khot and O. Regev. Vertex Cover Might Be Hard to Approximate toWithin 2 - e. In 18th IEEE Conference on Computational Complexity, pages 379–386, 2003.
144. V. M. Khrapchenko. A Method of Determining Lower Bounds for the Complexity of Pi- Schemes. In Matematicheskie Zametki, Vol. 10 (1), pages 83–92, 1971 (in Russian). English translation in Mathematical Notes of the Academy of Sciences of the USSR, Vol. 10 (1), pages 474–479, 1971.
145. J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments. In 24th ACM Symposium on the Theory of Computing, pages 723–732, 1992.
146. D. E. Knuth. The Art of Computer Programming, Vol. 2 (Seminumerical Algorithms). Addison-Wesley, 1969 (first edition) and 1981 (second edition).
147. A. Kolmogorov. Three Approaches to the Concept of “The Amount of Information.” Probl. of Inform. Transm., Vol. 1 (1), 1965.
148. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1996.
149. R. E. Ladner. On the Structure of Polynomial Time Reducibility. Journal of the ACM, Vol. 22, 1975, pages 155–171.
150. C. Lautemann. BPP and the Polynomial Hierarchy. Information Processing Letters, Vol. 17, pages 215–217, 1983.
151. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.
152. L. A. Levin. Universal Search Problems. Problemy Peredaci Informacii 9, pages 115–116, 1973 (in Russian). English translation in Problems of Information Transmission 9, pages 265–266. A better English translation appears in [221].
153. L. A. Levin. Randomness Conservation Inequalities: Information and Independence in Mathematical Theories. Information and Control, Vol. 61, pages 15–37, 1984.
154. L. A. Levin. Average Case Complete Problems. SIAM Journal on Computing, Vol. 15, pages 285–286, 1986.
155. L. A. Levin. Fundamentals of Computing. SIGACT News, Education Forum, special 100th issue, Vol. 27 (3), pages 89–110, 1996.
156. M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer Verlag, August 1993.
157. R. J. Lipton. New Directions in Testing. Distributed Computing and Cryptography, J. Feigenbaum andM. Merritt (eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematics Society, Vol. 2, pages 191–202, 1991.
158. N. Livne. All Natural NPC Problems Have Average-Case Complete Versions. ECCC, TR06- 122, 2006.
159. C.-J. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: Optimal up to Constant Factors. In 35th ACM Symposium on the Theory of Computing, pages 602–611, 2003.
160. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan Graphs. Combinatorica, Vol. 8, pages 261–277, 1988.
161. M. Luby and A. Wigderson. Pairwise Independence and Derandomization. Foundations and Trends in Theoretical Computer Science, Vol. (4), 2005. Preliminary version: TR-95-035, ICSI, Berkeley, 1995.
162. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic Methods for Interactive Proof Systems. Journal of the ACM, Vol. 39 (4), pages 859–868, 1992. Preliminary version in 31st FOCS, 1990.
163. F. MacWilliams and N. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1981.
164. G. A. Margulis. Explicit Construction of Concentrators. Prob. Per. Infor., Vol. 9 (4), pages 71–80, 1973 (in Russian). English translation in Problems of Infor. Trans., pages 325–332, 1975.
165. S. Micali. Computationally Sound Proofs. SIAM Journal on Computing, Vol. 30 (4), pages 1253–1298, 2000. Preliminary version in 35th FOCS, 1994.
166. G. L. Miller. Riemann’s Hypothesis and Tests for Primality. Journal of Computer and System Science, Vol. 13, pages 300–317, 1976.
167. P.B. Miltersen and N.V. Vinodchandran. Derandomizing Arthur-Merlin Games Using Hitting Sets. Computational Complexity, Vol. 14 (3), pages 256–279, 2005. Preliminary version in 40th FOCS, 1999.
168. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
169. M. Naor. Bit Commitment Using Pseudorandom Generators. Journal of Cryptology, Vol. 4, pages 151–158, 1991.
170. J. Naor and M. Naor. Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM Journal on Computing, Vol. 22, pages 838–856, 1993. Preliminary version in 22nd STOC, 1990.
171. M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Application. In 21st ACM Symposium on the Theory of Computing, pages 33–43, 1989.
172. M. Nguyen, S. J. Ong, and S. Vadhan. Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. In 47th IEEE Symposium on Foundations of Computer Science, pages 3-14, 2006.
173. N. Nisan. Pseudorandom Bits for Constant Depth Circuits. Combinatorica, Vol. 11 (1), pages 63–70, 1991.
174. N. Nisan. Pseudorandom Generators for Space Bounded Computation. Combinatorica, Vol. 12 (4), pages 449–461, 1992. Preliminary version in 22nd STOC, 1990.
175. N. Nisan. RL ? SC. Computational Complexity, Vol. 4, pages 1-11, 1994. Preliminary version in 24th STOC, 1992.
176. N. Nisan and A. Wigderson. Hardness vs Randomness. Journal of Computer and System Science, Vol. 49 (2), pages 149–167, 1994. Preliminary version in 29th FOCS, 1988.
177. N. Nisan and D. Zuckerman. Randomness Is Linear in Space. Journal of Computer and System Science, Vol. 52 (1), pages 43–52, 1996. Preliminary version in 25th STOC, 1993.
178. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
179. C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes. In 20th ACM Symposium on the Theory of Computing, pages 229–234, 1988.
180. N. Pippenger and M. J. Fischer. Relations Among Complexity Measures. Journal of the ACM, Vol. 26 (2), pages 361–381, 1979.
181. E. Post. A Variant of a Recursively Unsolvable Problem. Bull. AMS, Vol. 52, pages 264–268, 1946.
182. M. O. Rabin. Digitalized Signatures. In Foundations of Secure Computation (R. A. DeMillo et al. eds.), Academic Press, 1977.
183. M. O. Rabin. Digitalized Signatures and Public Key Functions as Intractable as Factoring. MIT/LCS/TR-212, 1979.
184. M. O. Rabin. Probabilistic Algorithm for Testing Primality. Journal of Number Theory, Vol. 12, pages 128–138, 1980.
185. R. Raz. A Parallel Repetition Theorem. SIAM Journal on Computing, Vol. 27 (3), pages 763–803, 1998. Extended abstract in 27th STOC, 1995.
186. R. Raz and A. Wigderson. Monotone Circuits for Matching Require Linear Depth. Journal of the ACM, Vol. 39 (3), pages 736–744, 1992. Preliminary version in 22nd STOC, 1990.
187. A. Razborov. Lower Bounds for the Monotone Complexity of some Boolean Functions. In Doklady Akademii Nauk SSSR, Vol. 281 (4), pages 798–801, 1985 (in Russian). English translation in Soviet Math. Doklady, Vol. 31, pages 354–357, 1985.
188. A. Razborov. Lower Bounds on the Size of Bounded-Depth Networks over a Complete Basis with Logical Addition. In Matematicheskie Zametki, Vol. 41 (4), pages 598–607, 1987 (in Russian). English translation in Mathematical Notes of the Academy of Sci. of the USSR, Vol. 41 (4), pages 333–338, 1987.
189. A. R. Razborov and S. Rudich. Natural Proofs. Journal of Computer and System Science, Vol. 55 (1), pages 24–35, 1997. Preliminary version in 26th STOC, 1994.
190. O. Reingold. Undirected ST-Connectivity in Log-Space. In 37th ACM Symposium on the Theory of Computing, pages 376–385, 2005.
191. O. Reingold, S. Vadhan, and A. Wigderson. Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. Annals of Mathematics, Vol. 155 (1), pages 157–187, 2001. Preliminary version in 41st FOCS, pages 3–13, 2000.
192. H. G. Rice. Classes of Recursively Enumerable Sets and Their Decision Problems. Trans. AMS, Vol. 89, pages 25–59, 1953.
193. R. L. Rivest, A. Shamir, and L.M. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. CACM, Vol. 21 (Feb.), pages 120–126, 1978.
194. D. Ron. Property Testing. In Handbook on Randomization, Volume 2, S. Rajasekaran, P. M. Pardalos, J. H. Reif, and J. D. P. Rolim (eds.), pages 597–649, 2001.
195. R. Rubinfeld and M. Sudan. Robust Characterization of Polynomials with Applications to Program Testing. SIAM Journal on Computing, Vol. 25 (2), pages 252–271, 1996.
196. M. Saks and S. Zhou. BPHSPACE(S) ? DSPACE(S3/2). Journal of Computer and System Science, Vol. 58 (2), pages 376–403, 1999. Preliminary version in 36th FOCS, 1995.
197. W. J. Savitch. Relationships Between Nondeterministic andDeterministic Tape Complexities. Journal of Computer and System Science, Vol. 4 (2), pages 177–192, 1970.
198. A. Selman. On the Structure of NP. Notices Amer. Math. Soc., Vol. 21 (6), page 310, 1974.
199. J. T. Schwartz. Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of the ACM, Vol. 27 (4), pages 701–717, October 1980.
200. R. Shaltiel. Recent Developments in Explicit Constructions of Extractors. In Current Trends in Theoretical Computer Science: The Challenge of the New Century, Vol. 1: Algorithms and Complexity, G. Paun, G. Rozenberg, and A. Salomaa (eds.), World Scientific, 2004. Preliminary version in Bulletin of the EATCS 77, pages 67–95, 2002.
201. R. Shaltiel and C. Umans. Simple Extractors for All Min-Entropies and a New Pseudo- Random Generator. In 42nd IEEE Symposium on Foundations of Computer Science, pages 648–657, 2001.
202. A. Shamir. IP = PSPACE. Journal of the ACM, Vol. 39 (4), pages 869–877, 1992. Preliminary version in 31st FOCS, 1990.
203. C. E. Shannon. A Symbolic Analysis of Relay and Switching Circuits. Trans. American Institute of Electrical Engineers, Vol. 57, pages 713–723, 1938.
204. C. E. Shannon. A Mathematical Theory of Communication. Bell Sys. Tech. Jour., Vol. 27, pages 623–656, 1948.
205. C. E. Shannon. Communication Theory of Secrecy Systems. Bell Sys. Tech. Jour., Vol. 28, pages 656–715, 1949.
206. A. Shpilka. Lower Bounds for Matrix Product. SIAM Journal on Computing, pages 1185-1200, 2003.
207. M. Sipser. A Complexity Theoretic Approach to Randomness. In 15th ACM Symposium on the Theory of Computing, pages 330–335, 1983.
208. M. Sipser. Introduction to the Theory of Computation. PWS Publishing, 1997.
209. R. Smolensky. Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In 19th ACM Symposium on the Theory of Computing, pages 77–82, 1987.
210. R. J. Solomonoff. A Formal Theory of Inductive Inference. Information and Control, Vol. 7 (1), pages 1–22, 1964.
211. R. Solovay and V. Strassen. A Fast Monte-Carlo Test for Primality. SIAM Journal on Computing, Vol. 6, pages 84–85, 1977. Addendum in SIAM Journal on Computing, Vol. 7, page 118, 1978.
212. D. A. Spielman. Advanced Complexity Theory, Lectures 10 and 11. Notes (by D. Lewin and S. Vadhan), March 1997. Available from http://www.cs.yale.edu/homes/spielman/AdvComplexity/1998/aslect10.ps and lect11.ps.
213. L. J. Stockmeyer. The Polynomial-Time Hierarchy. Theoretical Computer Science, Vol. 3, pages 1–22, 1977.
214. L. Stockmeyer. The Complexity of Approximate Counting. In 15th ACM Symposium on the Theory of Computing, pages 118–126, 1983.
215. V. Strassen. Algebraic Complexity Theory. In Handbook of Theoretical Computer Science: Volume A: Algorithms and Complexity, J. van Leeuwen (ed.), MIT Press/Elsevier, pages 633–672, 1990.
216. M. Sudan. Decoding of Reed Solomon Codes Beyond the Error-Correction Bound. Journal of Complexity, Vol. 13 (1), pages 180–193, 1997.
217. M. Sudan. Algorithmic Introduction to Coding Theory. Lecture notes, available from http://theory.csail.mit.edu/˜madhu/FT01/, 2001.
218. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom GeneratorsWithout the XOR Lemma. Journal of Computer and System Science, Vol. 62 (2), pages 236–266, 2001.
219. R. Szelepcsenyi. A Method of Forced Enumeration for Nondeterministic Automata. Acta Informatica, Vol. 26, pages 279–284, 1988.
220. S. Toda. PP Is as Hard as the Polynomial-Time Hierarchy. SIAM Journal on Computing, Vol. 20 (5), pages 865–877, 1991.
221. B. A. Trakhtenbrot. A Survey of Russian Approaches to Perebor (Brute Force Search) Algorithms. Annals of the History of Computing, Vol. 6 (4), pages 384–398, 1984.
222. L. Trevisan. Extractors and Pseudorandom Generators. Journal of the ACM, Vol. 48 (4), pages 860–879, 2001. Preliminary version in 31st STOC, 1999.
223. L. Trevisan. On Uniform Amplification of Hardness in NP. In 37th ACM Symposium on the Theory of Computing, pages 31–38, 2005.
224. V. Trifonov. An O(log n log log n) Space Algorithm for Undirected st-Connectivity. In 37th ACM Symposium on the Theory of Computing, pages 623–633, 2005.
225. A. M. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. Londom Mathematical Soceity, Ser. 2, Vol. 42, pages 230–265, 1936. A Correction, Vol. 43, pages 544–546.
226. C. Umans. Pseudo-Random Generators for All Hardness. Journal of Computer and System Science, Vol. 67 (2), pages 419–440, 2003.
227. S. Vadhan. A Study of Statistical Zero-Knowledge Proofs. Ph.D. thesis, MIT, 1999. Available from http://www.eecs.harvard.edu/∼salil/papers/phdthesisabs.html.
228. S. Vadhan. An Unconditional Study of Computational Zero Knowledge. SIAM Journal on Computing, Vol. 36 (4), pages 1160–1214, 2006. Extended abstract in 45th FOCS, 2004.
229. S. Vadhan. Lecture Notes for CS 225: Pseudorandomness, Spring 2007. Available from http://www.eecs.harvard.edu/∼salil.
230. L. G. Valiant. The Complexity of Computing the Permanent. Theoretical Computer Science, Vol. 8, pages 189–201, 1979.
231. L. G. Valiant. Completeness Classes in Algebra. In 11th ACM Symposium on the Theory of Computing, pages 249–261, 1979.
232. L. G. Valiant. A Theory of the Learnable. CACM, Vol. 27 (11), pages 1134–1142, 1984.
233. 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.
234. J. von Neumann. First Draft of a Report on the EDVAC, 1945. Contract No. W-670-ORD- 492, Moore School of Electrical Engineering, Univ. of Pennsylvania. Reprinted (in part) in Origins of Digital Computers: Selected Papers, Springer-Verlag, pages 383–392, 1982.
235. J. von Neumann, Zur Theorie der Gesellschaftsspiele. Mathematische Annalen, 100, pages 295–320, 1928.
236. I. Wegener. The Complexity of Boolean Functions. Wiley-Teubner, 1987.
237. I. Wegener. Branching Programs and Binary Decision Diagrams – Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications, 2000.
238. A. Wigderson. The Amazing Power of Pairwise Independence. In 26th ACM Symposium on the Theory of Computing, pages 645–647, 1994.
239. A. C. Yao. Theory and Application of Trapdoor Functions. In 23rd IEEE Symposium on Foundations of Computer Science, pages 80–91, 1982.
240. A. C. Yao. Separating the Polynomial-Time Hierarchy by Oracles. In 26th IEEE Symposium on Foundations of Computer Science, pages 1-10, 1985.
241. A. C. Yao. How to Generate and Exchange Secrets. In 27th IEEE Symposium on Foundations of Computer Science, pages 162–167, 1986.
242. S. Yekhanin. Towards 3-Query Locally Decodable Codes of Subexponential Length. In 39th ACM Symposium on the Theory of Computing, pages 266–274, 2007.
243. R. E. Zippel. Probabilistic Algorithms for Sparse Polynomials. In the Proceedings of EUROSAM ’79: International Symposium on Symbolic and Algebraic Manipulation, E. Ng (ed.). Lecture Notes in Computer Science (Vol. 72), pages 216–226, Springer, 1979.
244. D. Zuckerman. Linear-Degree Extractors and the Inapproximability of Max-Clique and Chromatic Number. In 38th ACM Symposium on the Theory of Computing, pages 681–690, 2006.