Complexity theory

Exploring the Limits of Efficient Algorithms

Autori

• Ingo Wegener

Parametri

• 308 pagine
• 11 ore di lettura

• Matematica

Maggiori informazioni sul libro

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.

Lingua: Inglese

Pubblicato: 2005

(Copertina rigida)