Complexity Theory
Exploring the Limits of Efficient Algorithms
- Publisher's listprice EUR 85.59
-
36 307 Ft (34 578 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 8% (cc. 2 905 Ft off)
- Discounted price 33 402 Ft (31 812 Ft + 5% VAT)
36 307 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2005
- Publisher Springer
- Date of Publication 11 April 2005
- Number of Volumes 1 pieces, Book
- ISBN 9783540210450
- Binding Hardback
- No. of pages308 pages
- Size 235x155 mm
- Weight 1390 g
- Language English
- Illustrations XII, 308 p. Illustrations, black & white 0
Categories
Short 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.
MoreLong 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.
From the reviews:
"This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms ? . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. ? The text is well written ? and the translation is successful." (Gerhard Lischke, Mathematical Reviews, Issue 2006 j)
"Complexity theory is an extremely important and vivid field on the border of mathematics and computer science. ? Ingo Wegener certainly created an appealing, well-written book that is a definite choice for the specialists and lecturers when an undergraduate or graduate student asks for guidance into this challenging new field of mathematics." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)
MoreTable of Contents:
Algorithmic Problems & Their Complexity.- Fundamental Complexity Classes.- Reductions ? Algorithmic Relationships Between Problems.- The Theory of NP-Completeness.- NP-complete and NP-equivalent Problems.- The Complexity Analysis of Problems.- The Complexity of Approximation Problems ? Classical Results.- The Complexity of Black Box Problems.- Additional Complexity Classes and Relationships Between Complexity Classes.- Interactive Proofs.- The PCP Theorem and the Complexity of Approximation Problems.- Further Topics From Classical Complexity Theory.- The Complexity of Non-uniform Problems.- Communication Complexity.- The Complexity of Boolean Functions.
More
