Theory of computational complexity - Info and Reading Options
By Dingzhu Du
"Theory of computational complexity" was published by J. Wiley & Sons in 2014 - Hoboken, NJ and it has 1 pages.
“Theory of computational complexity” Metadata:
- Title: ➤ Theory of computational complexity
- Author: Dingzhu Du
- Number of Pages: 1
- Publisher: J. Wiley & Sons
- Publish Date: 2014
- Publish Location: Hoboken, NJ
Edition Identifiers:
- ISBN-13: 9781118594971
- All ISBNs: 9781118594971
AI-generated Review of “Theory of computational complexity”:
"Theory of computational complexity" Description:
Open Data:
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
Read “Theory of computational complexity”:
Read “Theory of computational complexity” by choosing from the options below.
Search for “Theory of computational complexity” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Theory of computational complexity” in Libraries Near You:
Read or borrow “Theory of computational complexity” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Theory of computational complexity” at a library near you.
Buy “Theory of computational complexity” online:
Shop for “Theory of computational complexity” on popular online marketplaces.
- Ebay: New and used books.