Skip to main content
Springer Nature Link
Log in

Computational Complexity Theory

  • Reference work entry
Encyclopedia of Optimization

  • 533 Accesses

Article Outline

Keywords

Definitions

The Nature of the Time Complexity Function

Polynomial Versus Exponential Algorithms

Reducibility

Classification of Hard Problems

Using Reduction to Establish Complexity

See also

References

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Cook SA (1971) The complexity of theorem proving procedures. Proc. 3rd Annual ACM Symposium on Theory of Computing. ACM, New York, pp 151–158

    Chapter  Google Scholar 

  2. Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York

    MATH  Google Scholar 

  3. Hardy GH, Wright EM (1979) An introduction to the theory of numbers. Clarendon Press, Oxford

    MATH  Google Scholar 

  4. Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA

    MATH  Google Scholar 

  5. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum, New York, pp 85–103

    Google Scholar 

  6. Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading, MA

    MATH  Google Scholar 

  7. Pinedo M (1995) Scheduling: Theory, algorithms and systems. Prentice-Hall, Englewood Cliffs, NJ

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department OR and Operations Management, Case Western Reserve University, Cleveland, USA

    Hamilton Emmons & Sanatan Rai

Authors
  1. Hamilton Emmons
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanatan Rai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Emmons, H., Rai, S. (2008). Computational Complexity Theory . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_83

Download citation

Publish with us

Policies and ethics