Description du livre Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 classesa 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 Todaa 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 and practical 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 mannerProvides 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 316 pp. Englisch. N� de r�f. du vendeur 9781461406815

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 90,94

Autre devise

Ajouter au panier

Frais de port : EUR 23

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Image d'archives

Computability and Complexity Theory

Steven Homer

Edit� par Springer-Verlag New York Inc. (2011)

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Couverture rigide Quantit� disponible : > 20

impression � la demande

Vendeur :

THE SAINT BOOKSTORE
(Southport, Royaume-Uni)

Evaluation vendeur

Evaluation du vendeur :

Description du livre Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. N� de r�f. du vendeur C9781461406815

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 113,83

Autre devise

Ajouter au panier

Frais de port : EUR 10,60

De Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Image fournie par le vendeur

Computability and Complexity Theory

Homer, Steven; Selman, Alan L.

Edit� par Springer (2011)

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Couverture rigide Quantit� disponible : 5

Vendeur :

GreatBookPricesUK
(Castle Donington, DERBY, Royaume-Uni)

Evaluation vendeur

Evaluation du vendeur :

Description du livre Etat : New. N� de r�f. du vendeur 13310234-n

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 107,79

Autre devise

Ajouter au panier

Frais de port : EUR 17,76

De Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Image fournie par le vendeur

Computability and Complexity Theory

Steven Homer|Alan L. Selman

Edit� par Springer US (2011)

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Couverture rigide Quantit� disponible : > 20

Vendeur :

moluna
(Greven, Allemagne)

Evaluation vendeur

Evaluation du vendeur :

Description du livre Etat : New. N� de r�f. du vendeur 4196902

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 79,10

Autre devise

Ajouter au panier

Frais de port : EUR 48,99

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Image fournie par le vendeur

Computability and Complexity Theory

Alan L. Selman

Edit� par Springer US (2011)

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Couverture rigide Quantit� disponible : 1

Vendeur :

AHA-BUCH GmbH
(Einbeck, Allemagne)

Evaluation vendeur

Evaluation du vendeur :

Description du livre Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 classesa 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 Todaa 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 mannerProvides 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. N� de r�f. du vendeur 9781461406815

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 95,18

Autre devise

Ajouter au panier

Frais de port : EUR 32,99

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Image d'archives