Complexity Theory

Exploring the Limits of Efficient Algorithms

  • Ingo Wegener

About this book


Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:

New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science.

The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.


Black-box problem Boolean function Communication Complexity Complexity Theory Interactive proof NP-Completeness O-nation PCP-Theorem Randomization Theoretical Computer Science algorithm design algorithms communication complexity

Authors and affiliations

  • Ingo Wegener
    • 1
  1. 1.Fachbereich Informatik Lehrstuhl Informatik IIUniversität DortmundDortmundGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-21045-0
  • Online ISBN 978-3-540-27477-3
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
IT & Software
Energy, Utilities & Environment