Computability and Complexity Theory (Texts in Computer Science)

Homer, Steven; Selman, Alan L.

ISBN 10: 1461406811 ISBN 13: 9781461406815

Edit� par Springer, 2011

Neuf(s) Couverture rigide

Vendeur Ria Christie Collections, Uxbridge, Royaume-Uni �valuation du vendeur 5 sur 5 �toiles

Vendeur AbeBooks depuis 25 mars 2015

Cet article sp�cifique n'est plus disponible.

Afficher tous les articles du vendeur Cr�er une demande de livres portant sur des articles similaires

Afficher tous les exemplaires de ce livre

A propos de cet article

In. N� de r�f. du vendeur ria9781461406815_new

Signaler cet article

Synopsis :

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

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

D�tails bibliographiques

Titre : Computability and Complexity Theory (Texts ...
�diteur : Springer
Date d'�dition : 2011
Reliure : Couverture rigide
Etat : New
Edition : 2�me �dition

Meilleurs r�sultats de recherche sur AbeBooks

Image d'archives

Computability and Complexity Theory (Texts in Computer Science)

Selman, Alan L.,Homer, Steven

Edit� par Springer, 2011

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Ancien ou d'occasion Couverture rigide

Vendeur : HPB-Red, Dallas, TX, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! N� de r�f. du vendeur S_332974070

Contacter le vendeur

Acheter D'occasion

EUR 65,62

EUR 3,20 shipping
Exp�dition nationale�: Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

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

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 4 sur 5 �toiles

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

Contacter le vendeur

Acheter neuf

EUR 79,10

EUR 48,99 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Autres images

Computability and Complexity Theory

Alan L. Selman (u. a.)

Edit� par Springer US, 2011

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Couverture rigide

impression � la demande

Vendeur : preigu, Osnabr�ck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Contacter le vendeur

Acheter neuf

EUR 82,20

EUR 70 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Computability and Complexity Theory

Alan L. Selman

Edit� par Springer US Dez 2011, 2011

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Buch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

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

Contacter le vendeur

Acheter neuf

EUR 90,94

EUR 23 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Computability and Complexity Theory

Alan L. Selman

Edit� par Springer US, Springer New York Dez 2011, 2011

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Buch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. 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, andrelative 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 PSPACEWith 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 classesContains 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 algebraSupported by numerous exercises and supplementary problems for reinforcement and self-study purposesSpringer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 316 pp. Englisch. N� de r�f. du vendeur 9781461406815

Contacter le vendeur

Acheter neuf

EUR 90,94

EUR 60 shipping
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Computability and Complexity Theory (Texts in Computer Science)

Homer, Steven; Selman, Alan L.

Edit� par Springer, 2011

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Couverture rigide

Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Etat : New. N� de r�f. du vendeur ABLIING23Mar2716030035129

Contacter le vendeur

Acheter neuf

EUR 93,60

EUR 3,40 shipping
Exp�dition nationale�: Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Computability and Complexity Theory

Alan L. Selman

Edit� par Springer US, Springer US, 2011

ISBN 10 : 1461406811 ISBN 13 : 9781461406815

Neuf Couverture rigide

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

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

Contacter le vendeur