This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:

a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp─Lipton.
a chapter studying properties of the fundamental probabilistic complexity classes
a study of the alternating Turing machine and uniform circuit classes.
an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Toda
a thorough treatment of the proof that IP is identical to PSPACE

With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential andpractical learning tool.

Topics and features:

Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes
Contains information that otherwise exists only in research literature and presents it in a unified, simplified manner
Provides key mathematical background information, including sections on logic and number theory and algebra
Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes

Pr�sentation de l'�diteur

This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

Description de la librairie

50+ Million Books in stock & ready to ship! Excellent Prices, Service & Selection.

Visitez la page d�accueil du vendeur

Informations commerciales relatives au vendeur

Conditions de vente et de livraison

Conditions g�n�rales de vente

When you see an item on our listing, it means we have it available in one of our warehouses right here right now, ready for same day or next day processing of your order. Over 50+ Million books in stock & ready to ship same day. Customer Service is a top priority for us, we want every customer to be 100% satisfied. We offer the world's largest selection of books, music and video. Maintaining an accurate inventory of more than 50+ Million items, we are able to ship your order the same day it is r...

Pour plus d'information