Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)
Description:
Praise for the First Edition
"...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity." -Zentralblatt MATH
A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered.
Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as:
- A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science
- Additional exercises at varying levels of difficulty to further test comprehension of the presented material
- End-of-chapter literature reviews that summarize each topic and offer additional sources for further study
Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.
A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent devBest prices to buy, sell, or rent ISBN 9781118306086
Frequently Asked Questions about Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)
The price for the book starts from $117.15 on Amazon and is available from 18 sellers at the moment.
At BookScouter, the prices for the book start at $121.21. Feel free to explore the offers for the book in used or new condition from various booksellers, aggregated on our website.
If you’re interested in selling back the Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.
As for the Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) book, the best buyback offer comes from and is $ for the book in good condition.
The Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) book is in very low demand now as the rank for the book is 4,722,019 at the moment. A rank of 1,000,000 means the last copy sold approximately a month ago.
The highest price to sell back the Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) book within the last three months was on December 20 and it was $2.21.