ENGLISH

Complexity Theory: Exploring the Limits of Efficient Algorithms

By Ingo Wegener

Book information

Publisher
Springer
Year
2005
ISBN
3540210458, 9783540210450
Language
english
Format
PDF
Filesize
2 MB (2327473 bytes)
Pages
320\307
Time added
2024-03-19 19:21:05

Description

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.

Similar books