Skip to main content
SpringerLink
Log in

Complexity Theory

  • Chapter
  • First Online:
Computer Science

Abstract

Complexity theory is the area of the theory of computation that deals with the study and classification of the amount of computational resources required to solve problems. The subject is intellectually exciting and central to the field of computer science as well as to understanding how complex systems outside of computer science behave and compute. Complexity theory is an active area of research, still having some of the deepest unsolved problems in mathematics and computer science.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Agrawal, M., Kayal, N., and Saxena, N. PRIMES is in P. Annals of Mathematics 160, 2 (2004), 781–793.

    Article  MATH  MathSciNet  Google Scholar 

  • Aho, A. V., Hopcroft, J. E., and Ullman, J. D. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  • Aho, A. V., Lam, M., Sethi, R., and Ullman, J. D. Compilers: Principles, Techniques, and Tools, second edition, Addison-Wesley, 2007.

    Google Scholar 

  • Arora, S., and Safra, S. Probabilistic checking of proofs: a new characterization of NP, Journal of the ACM 45, 1 (1998), 70–122.

    Article  MATH  MathSciNet  Google Scholar 

  • Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. Proof verification and the hardness of approximation problems, Journal of the ACM 45, 3 (1998), 501–555.

    Article  MATH  MathSciNet  Google Scholar 

  • Arora, S., and Boaz, B. Computational Complexity: A Modern Approach, Cambridge University Press, 2009.

    Google Scholar 

  • Babai, L., Fortnow, L., and Lund, C. Nondeterministic exponential time has two-prover interactive protocols, In Proceedings of the 31 st Annual IEEE Symposium on Foundations of Computer Science (1990), pp. 16–25.

    Google Scholar 

  • Babai, L., Fortnow, L., Levin, L., and Szegedy, M. Checking computations in polylogarithmic time, In Proceedings of the 23 rd Annual ACM Symposium on Theory of Computing (1991), pp. 21–32.

    Google Scholar 

  • Cobham, A. The intrinsic computational difficulty of functions. In Proceedings of the International Congress for Logic, Methodology, and Philosophy of Science, Y. Bar-Hillel, Ed., North-Holland, 1964. pp. 24–30.

    Google Scholar 

  • Cook, S. A. The complexity of theorem-proving procedures. In Proceedings of the Third Annual ACM Conference on the Theory of Computing (1971), pp. 151–158.

    Google Scholar 

  • Dinur, I. The PCP theorem by gap amplification. Journal of the ACM 54, 3 (2007).

    Google Scholar 

  • Edmonds, J. Paths, trees, and flowers. Canadian Journal of Mathematics 17 (1965), 449–467.

    Article  MATH  MathSciNet  Google Scholar 

  • Feige, U., Goldwasser, S., Lovasz, L., Safra, S., and Szegedy, M. Interactive proofs and the hardness of approximating cliques, Journal of the ACM 43, 2 (1991), 268–292.

    Article  MathSciNet  Google Scholar 

  • Garey, M. R., and Johnson, D. S. Computers and Intractability – A Guide to the Theory of NP-completeness. W. H. Freeman, 1979.

    Google Scholar 

  • Goldwasser, S., Micali, S., and Rackoff, C. The knowledge complexity of interactive proof systems. SIAM Journal on Computing (1989), 186–208.

    Google Scholar 

  • Hartmanis, J., and Stearns, R. E. On the computational complexity of algorithms. Transactions of the American Mathematical Society 117 (1965), 285–306.

    Article  MATH  MathSciNet  Google Scholar 

  • HÃ¥stad, J. Some optimal inapproximability results. Journal of the ACM 48, 4 (2001), 105–142.

    Article  Google Scholar 

  • Hennie, F. C., and Stearns, R. E. Two tape simulation of multitape Turing machines, Journal of the ACM 13, 4 (1966), 533–546.

    Article  MATH  MathSciNet  Google Scholar 

  • Johnson, D. S. Approximation algorithms for combinatorial problems. Journal of Computer and Systems Sciences 9 (1974), 256–278.

    Article  MATH  Google Scholar 

  • Karp, R. M. Reducibility among combinatorial problems. In Complexity of Computer Computations (1972), R. E. Miller and J. W. Thatcher, Eds., Plenum Press, pp. 85–103.

    Google Scholar 

  • Ladner, R. On the structure of polynomial time reducibility. Journal of the ACM 22, 1 (1975), 155–171.

    Article  MATH  MathSciNet  Google Scholar 

  • Levin, L. Universal search problems (in Russian). Problemy Peredachi Informatsii 9, 3 (1973), 115–116.

    MATH  MathSciNet  Google Scholar 

  • Papadimitriou, C. H. Computational Complexity. Addison-Wesley, 1994.

    Google Scholar 

  • Papadimitriou, C. H., and Yannakakis, M. Optimization, approximation, and complexity classes. Journal of Computer and Systems Sciences 43, 3 (1991), 425–440.

    Article  MATH  MathSciNet  Google Scholar 

  • Sipser, M. Introduction to the Theory of Computation, Second Edition. Thomson, 2006.

    MATH  Google Scholar 

  • Trevisan, L. Inapproximability of combinatorial optimization problems. University of California, Berkeley, 2004.

    Google Scholar 

  • Turing, A. On computable numbers with an application to the Entscheidungsproblem. In Proc. London Mathematical Society 42, pp. 230–265, 1936.

    Article  Google Scholar 

  • Vazirani, V. Approximation Algorithms. Springer, 2003.

    Google Scholar 

Download references

Acknowledgement

The author is very grateful to Rocco Servedio and Mihalis Yannakakis for many insightful remarks and clarifying comments.

Author information

Authors and Affiliations

  1. Columbia University, New York, NY, USA

    Alfred V. Aho

Authors
  1. Alfred V. Aho
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alfred V. Aho .

Editor information

Editors and Affiliations

  1. , Mathematics Department, University of Southern California, Los Angeles, 90089, California, USA

    Edward K. Blum

  2. , Department of Computer Science, Columbia University, New York, 10027, New York, USA

    Alfred V. Aho

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Aho, A.V. (2011). Complexity Theory. In: Blum, E., Aho, A. (eds) Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1168-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-1168-0_12

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-1167-3

  • Online ISBN: 978-1-4614-1168-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation