Check nearby libraries
Buy 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.
Check nearby libraries
Buy this book

Previews available in: English
Edition | Availability |
---|---|
1
Complexity Theory: Exploring the Limits of Efficient Algorithms
Oct 13, 2010, Springer
paperback
3642059147 9783642059148
|
zzzz
|
2 |
zzzz
|
3
Complexity theory: exploring the limits of efficient algorithms
2005, Springer
in English
3540210458 9783540210450
|
aaaa
|
4
Complexity Theory: Exploring the Limits of Efficient Algorithms
December 31, 1899, Springer
Hardcover
in English
- 1 edition
3540210458 9783540210450
|
zzzz
|
Book Details
Edition Notes
Translated from the German.
Includes bibliographical references (p. [295]-299) and index.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
History
- Created April 1, 2008
- 14 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
August 12, 2024 | Edited by MARC Bot | import existing book |
December 31, 2022 | Edited by MARC Bot | import existing book |
November 14, 2022 | Edited by ImportBot | import existing book |
October 4, 2021 | Edited by ImportBot | import existing book |
April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |