Skip to main content
SpringerLink
Log in

Computational Complexity Since 1980

  • Conference paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3821))

  • 733 Accesses

Abstract

The field of computational complexity is reaching what could be termed middle age, with over forty years having passed since the first papers defining the discipline. With this metaphor in mind, the early nineteeneighties represented the end of adolescence for the area, the time when it stopped wondering what it would be when it grew up. During the childhood period of the sixties, research centered on establishing the extent to which computational complexity, or the inherrent computational resources required to solve a problem, actually existed and was well-defined.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.: Two Theorems on Random Polynomial Time. In: FOCS, pp. 75–83 (1978)

    Google Scholar 

  2. Aiello, W., Goldwasser, S., Hstad, J.: On the power of interaction. Combinatorica 10(1), 3–25 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Annals of Mathematics 160(2), 781–793 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ajtai, M.: Σ1,1 formulas on finite structures. Annals of Pure and Applied Logic (1983)

    Google Scholar 

  5. Ajtai, M., Komlos, J., Szemeredi, E.: Deterministic Simulation in LOGSPACE. In: 19th STOC, pp. 132–140 (1987)

    Google Scholar 

  6. Akavia, A., Goldwasser, S., Safra, S.: Proving Hard-core Predicates Using List Decoding. In: FOCS, pp. 146–156 (2003)

    Google Scholar 

  7. Aleliunas, R., Karp, R., Lipton, R., Lovasz, L., Rackoff, C.: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In: 20th FOCS, pp. 218–223 (1979)

    Google Scholar 

  8. Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P.: A new general derandomization method. Journal of the Association for Computing Machinery 45(1), 179–213 (1998), (preliminary version in ICALP 1996)

    MATH  MathSciNet  Google Scholar 

  9. Andreev, A., Clementi, A., Rolim, J., Trevisan, L.: Weak random sources, hitting sets, and BPP simulation. In: 38th FOCS, pp. 264–272 (1997)

    Google Scholar 

  10. Arora, S., Lund, C.: Hardness of Approximations. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, PWS Publishing (1996)

    Google Scholar 

  11. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the Association for Computing Machinery 45(3), 501–555 (1998)

    MATH  MathSciNet  Google Scholar 

  12. Arora, S., Sudan, M.: Improved low-degree testing and its applications. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 485–495 (1997)

    Google Scholar 

  13. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the Association for Computing Machinery 45 (1), 70–122 (1998) (preliminary version in FOCS 1992)

    MATH  MathSciNet  Google Scholar 

  14. Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking Computations in Polylogarithmic Time 23rd STOC, pp. 21-31 (1991)

    Google Scholar 

  15. Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3–40 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  16. Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unless EXPTIME has publishable proofs. Complexity 3, 307–318 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  17. Babai, L., Moran, S.: Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class. JCSS 36 (2), 254–276 (1988)

    MATH  MathSciNet  Google Scholar 

  18. Barak, B., Impagliazzo, R., Wigderson, A.: Extracting Randomness Using Few Independent Sources. In: 45th FOCS, pp. 384–393 (2004)

    Google Scholar 

  19. Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: new constructions of condesnsors, ramsey graphs, dispersers and extractors. In: 37th STOC, pp. 1–10 (2005)

    Google Scholar 

  20. Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 37–48. Springer, Heidelberg (1990)

    Google Scholar 

  21. Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. In: STOC, pp. 113–131 (1988)

    Google Scholar 

  22. Berlekamp, E.R.: Proc. of the 3rd Southeastern Conference on Combinatorics. In: Proc. of the 3rd Southeastern Conference on Combinatorics, GRAPH THEORY AND COMPUTING, pp. 1–7 (1972)

    Google Scholar 

  23. Blum, M.: Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov. Combinatorica 6(2), 97–108 (1986); Chain FOCS, 425-433 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  24. Blum, M., Kannan, S.: Designing Programs That Check Their Work. In: STOC, pp. 86–97 (1989)

    Google Scholar 

  25. Blum, M., Luby, M., Rubinfeld, R.: Self-Testing/Correcting with Applications to Numerical Problems. J. Comput. Syst. Sci. 47(3), 549–595 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  26. Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13, 850–864 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  27. Bourgain, J., Katz, N., Tao, T.: A sum-product estimate in finite fields, and applications. Geometric and Functional Analysis 14, 27–57 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  28. Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transaction on Information Theory IT-22 (6), 644–654 (1976)

    Article  MathSciNet  Google Scholar 

  29. Chor, B., Goldreich, O., Hstad, J., Friedman, J., Rudich, S., Smolensky, R.: The Bit Extraction Problem of t-Resilient Functions. In: FOCS, pp. 396–407 (1985)

    Google Scholar 

  30. Cook, S.: An Overview of Computational Complexity. Communications of the ACM 26(3), 401–407

    Google Scholar 

  31. Dinur, I.: The PCP Theorem by gap amplification. ECCC tech. report TR05-046 (2005)

    Google Scholar 

  32. Feige, U., Goldwasser, S., Lovasz, L., Safra, S., Szegedy, M.: Approximating Clique is Almost NP-complete. In: FOCS, pp. 2–12 (1991)

    Google Scholar 

  33. Fortnow, L.: Comparing notions of full derandomization. In: Proceedings of the Sixteenth Annual IEEE Conference on Computational Complexity, pp. 28–34 (2001)

    Google Scholar 

  34. Furst, M., Saxe, J.B., Sipser, M.: Parity, Circuits, and the Polynomial-Time Hierarchy. Mathematical Systems Theory 17(1), 13–27 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  35. Gabber, O., Galil, Z.: Explicit Constructions of Linear-Sized Superconcentrators. J. Comput. Syst. Sci. 22(3), 407–420 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  36. Gill, J.: Computational complexity of proabilistic Turing machines. SIAM J. Comput. 6, 675–695 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  37. Goldreich, O., Levin, L.A.: A Hard-Core Predicate for all One-Way Functions. In: ACM Symp. on Theory of Computing, pp. 25–32 (1989)

    Google Scholar 

  38. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792–807 (1986)

    Article  MathSciNet  Google Scholar 

  39. Goldwasser, S., Sipser, M.: Private Coins versus Public Coins in Interactive Proof Systems. In: STOC, pp. 59–68 (1986)

    Google Scholar 

  40. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1), 186–208 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  41. Hstad, J.: Almost Optimal Lower Bounds for Small Depth Circuits. In: STOC, pp. 6–20 (1986)

    Google Scholar 

  42. Hstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A Pseudorandom Generator from any One-way Function. SIAM J. Comput. 28(4), 1364–1396 (1999)

    Article  MathSciNet  Google Scholar 

  43. Heintz, J., Schnorr, C.-P.: Testing Polynomials which Are Easy to Compute. In: STOC, pp. 262–272 (1980)

    Google Scholar 

  44. Impagliazzo, R.: Hard-core Distributions for Somewhat Hard Problems. In: 36th FOCS, pp. 538–545 (1995)

    Google Scholar 

  45. Impagliazzo, R.: Hardness as randomness: a survey of universal derandomization. CoRR cs.CC/0304040 (2003)

    Google Scholar 

  46. Impagliazzo, R., Kabanets, V., Wigderson, A.: In search of an easy witness: Exponential time vs. probabilistic polynomial time. In: Proceedings of the Sixteenth Annual IEEE Conference on Computational Complexity, pp. 1–11 (2001)

    Google Scholar 

  47. Impagliazzo, R., Rudich, S.: Limits on the Provable Consequences of One-Way Permutations. In: STOC, pp. 44–61 (1989)

    Google Scholar 

  48. Impagliazzo, R., Wigderson, A.: P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 220–229 (1997)

    Google Scholar 

  49. Impagliazzo, R., Wigderson, A.: Randomness vs. time: Derandomization under a uniform assumption. In: Proceedings of the Thirty-Ninth Annual IEEE Symposium on Foundations of Computer Science, pp. 734–743 (1998)

    Google Scholar 

  50. Johnson, D.: The NP-completeness column: An ongoing guide (12th article) Journal of Algorithms 5, 433–447 (1984)

    Article  MATH  Google Scholar 

  51. Kabanets, V.: Easiness assumptions and hardness tests: Trading time for zero error. Journal of Computer and System Sciences 63(2), 236–252 (2001) (preliminary version in CCC 2000)

    Article  MATH  MathSciNet  Google Scholar 

  52. Kabanets, V.: Derandomization: A brief overview. Bulletin of the European Association for Theoretical Computer Science 76, 88–103 (2002) (also available as ECCC TR02-008)

    MATH  MathSciNet  Google Scholar 

  53. Kabanets, V., Impagliazzo, R.: Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Computational Complexity 13(1-2), 1–46 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  54. Kaltofen, E.: Polynomial factorization 1987–1991. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 294–313. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  55. Karp, R.M.: Combinatorics, Complexity, and Randomness. Commun. ACM 29(2), 97–109 (1986)

    Article  MathSciNet  Google Scholar 

  56. Karp, R.M., Lipton, R.J.: Turing Machines that Take Advice. L’Ensignment Mathematique 28, 191–209 (1982)

    MATH  MathSciNet  Google Scholar 

  57. Karp, R.M., Pippenger, N., Sipser, M.: A time randomness tradeoff AMS. In: Conference on Probabilistic Computational Complexity (1985)

    Google Scholar 

  58. Konyagin, S.: A sum-product estimate in fields of prime order Arxiv technical report 0304217 (2003)

    Google Scholar 

  59. Levin, L.A.: One-Way Functions and Pseudorandom Generators. Combinatorica 7(4), 357–363 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  60. Levin, L.A.: Average Case Complete Problems. SIAM J. Comput. 15(1), 285–286 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  61. New directions in testing. Distributed Computing and Cryptography (1991)

    Google Scholar 

  62. Luby, M., Rackoff, C.: How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM J. Comput. 17(2), 373–386 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  63. Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. Journal of the Association for Computing Machinery 39(4), 859–868 (1992)

    MATH  MathSciNet  Google Scholar 

  64. Lipton, R.: New directions in testing. In: Feigenbaum, J., Merrit, M. (eds.) Distributed Computing and Cryptography. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, pp. 191–202. AMS, Providence(1991)

    Google Scholar 

  65. Minsky, M., Pappert, S.: Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge (1969), (expanded edition, 1988)

    MATH  Google Scholar 

  66. Nisan, N., Wigderson, A.: Hardness vs. randomness. Journal of Computer and System Sciences 49, 149–167 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  67. Nisan, N., Zuckerman, D.: Randomness is Linear in Space. JCSS 52(1), 43–52 (1996)

    MATH  MathSciNet  Google Scholar 

  68. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  69. Papadimitriou, C.H., Yannakakis, M.: Optimization, Approximation, and Complexity Classes. In: STOC 1988, Computational Complexity, Addison-Wesley, Reading (1994)

    Google Scholar 

  70. Rabin, M.O.: Probabilistic Algorithm for Testing Primality. Journal of Number Theory 12, 128–138 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  71. Razborov, A.A.: Lower bounds for the monotone complexity of some Boolean functions. Doklady Akademii Nauk SSSR 281(4), 798–801 (1985), English translation in Soviet Math. Doklady 31, 354-357 (1985)

    MathSciNet  Google Scholar 

  72. Razborov, A.A.: Lower bounds on the size of bounded-depth networks over a complete basis with logical addition. Mathematicheskie Zemetki 41(4), 598–607 (1987), English translation in Notes of the Academy of Sci. of the USSR  41(4)333-338 (1987)

    MathSciNet  Google Scholar 

  73. Razborov, A.A., Rudich, S.: Natural proofs. Journal of Computer and System Sciences 55, 24–35 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  74. Riordan, J., Shannon, C.: The Number of Two-Terminal Series-Parallel Networks. Journal of Mathematics and Physics 21, 83–93 (1942)

    MathSciNet  Google Scholar 

  75. Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  76. Rudich, S.: The Use of Interaction in Public Cryptosystems. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 242–251. Springer, Heidelberg (1991)

    Google Scholar 

  77. Santha, M., Vazirani, U.V.: Generating Quasi-Random Sequences from Slightly Random Sources. In: 25th FOCS, pp. 434–440 (1984)

    Google Scholar 

  78. Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the Association for Computing Machinery 27(4), 701–717 (1980)

    MATH  MathSciNet  Google Scholar 

  79. Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudo-random generator. In: Proceedings of the Forty-Second Annual IEEE Symposium on Foundations of Computer Science, pp. 648–657 (2001)

    Google Scholar 

  80. Shamir, A.: IP=PSPACE. Journal of the Association for Computing Machinery 39(4), 869–877 (1992)

    MATH  MathSciNet  Google Scholar 

  81. Sipser, M.: Extractors, Randomness, or Time versus Space. JCSS 36(3), 379–383 (1988)

    MATH  MathSciNet  Google Scholar 

  82. Smolensky, R.: Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In: STOC, pp. 77–82 (1987)

    Google Scholar 

  83. Solovay, R., Strassen, V.: A fast Monte Carlo test for primality. SIAM Journal on Computing 6(1), 84–85 (1979)

    Article  MathSciNet  Google Scholar 

  84. Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences 62 (2), 236–266 (2001) (preliminary version in STOC 1999)

    Article  MATH  MathSciNet  Google Scholar 

  85. Sudan, M.: Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity 13(1), 180–193 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  86. Tardos, É.: The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica 8(1), 141–142 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  87. Toda, S.: On the computational power of PP and ⊕P. In: 30th FOCS, pp. 514–519 (1989)

    Google Scholar 

  88. Trevisan, L.: Extractors and pseudorandom generators. Journal of the Association for Computing Machinery 48(4), 860–879 (2001) (preliminary version in STOC 1999)

    MATH  MathSciNet  Google Scholar 

  89. Trevisan, L.: List Decoding Using the XOR Lemma. Electronic Colloquium on Computational Complexity tech report 03-042 (2003)

    Google Scholar 

  90. Umans, C.: Pseudo-random generators for all hardnesses. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing (2002)

    Google Scholar 

  91. Valiant, L.: Why is Boolean complexity theory difficult? In: Paterson, M.S. (ed.) Feedback Shift Registers. London Math. Society Lecture Note Series, vol. 169, pp. 84–94. Cambridge University Press, Cambridge (1992)

    Chapter  Google Scholar 

  92. von Neumann, J.: Various Techniques Used in Relation to Random Digits. Applied Math. Series 12, 36–38 (1951)

    Google Scholar 

  93. Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner, Chichester (1987)

    MATH  Google Scholar 

  94. Yablonski, S.: The algorithmic difficulties of synthesizing minimal switching circuits. Problemy Kibornetiki 2, 75–121 (1959)

    Google Scholar 

  95. Yao, A.C.: Theory and applications of trapdoor functions. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Foundations of Computer Science, pp. 80–91 (1982)

    Google Scholar 

  96. Yao, A.C.: Separating the Polynomial-Time Hierarchy by Oracles. In: FOCS, pp. 1–10 (1985)

    Google Scholar 

  97. Zippel, R.E.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 216–226. Springer, Heidelberg (1979)

    Google Scholar 

  98. Zuckerman, D.: General Weak Random Sources. In: 31st FOCS, pp. 534–543 (1990)

    Google Scholar 

  99. Zuckerman, D.: Simulating BPP Using a General Weak Random Source. In: FOCS, pp. 79–89 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, San Diego, La Jolla, CA, 92093-0114, USA

    Russell Impagliazzo

Authors
  1. Russell Impagliazzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Institute of Advanced Studies, Indian Institute of Science Campus, 560012, Bangalore, India

    Sundar Sarukkai

  2. Department of Comp. Sc. & Engg., Indian Institute of Technology Delhi, 110016, New Delhi, India

    Sandeep Sen

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Impagliazzo, R. (2005). Computational Complexity Since 1980. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_2

Download citation

  • DOI: https://doi.org/10.1007/11590156_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30495-1

  • Online ISBN: 978-3-540-32419-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation