Complexity Theory Exploring the Limits of Efficient Algorithms

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

Full description

Saved in:
Bibliographic Details
Main Author Wegener, Ingo
Format eBook Book
LanguageEnglish
Published Berlin, Heidelberg Springer Nature 2005
Springer
Springer Berlin Heidelberg
Edition1
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
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:Includes bibliographical references (p. [295]-299) and index
Translation of: Komplexitätstheorie - Grenzen der Effizienz von Algorithmen
ISBN:9783540274773
3540274774
3540210458
9783540210450
DOI:10.1007/3-540-27477-4