Complexity Theory Exploring the Limits of Efficient Algorithms

• Main Author: Wegener, Ingo
• Format: eBook Book
• Language: English
• Published: Berlin, Heidelberg Springer Nature 2005; Springer; Springer Berlin Heidelberg
• Edition: 1
• Subjects: Algorithm Analysis and Problem Complexity; Algorithms; Coding and Information Theory; Computer programming, programs, data; Computer Science; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Programming Techniques

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 consi...