Articles liés à Computability and Complexity Theory
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.
- ÉditeurSpringer
- Date d'édition2014
- ISBN 10 1489989714
- ISBN 13 9781489989710
- ReliureBroché
- Langueanglais
- Numéro d'édition2
- Nombre de pages316
Acheter neuf
Afficher cet article
EUR 90,77
EUR 6,18 expédition vers Etats-Unis
Destinations, frais et délais
Résultats de recherche pour Computability and Complexity Theory
Image d'archives
Computability and Complexity Theory (Texts in Computer Science)
Vendeur : Best Price, Torrance, CA, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9781489989710
Quantité disponible : 2 disponible(s)
Image d'archives
Computability and Complexity Theory (Texts in Computer Science)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar2716030159303
Quantité disponible : Plus de 20 disponibles
Image d'archives
Computability and Complexity Theory (Texts in Computer Science)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781489989710_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Computability and Complexity Theory
impression à la demandeVendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. 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 9781489989710
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Computability and Complexity Theory
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. 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 9781489989710
Quantité disponible : 1 disponible(s)
Image d'archives
Computability and Complexity Theory
Edité par
Springer-Verlag New York Inc., 2014
ISBN 10 : 1489989714
ISBN 13 : 9781489989710
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 516. N° de réf. du vendeur C9781489989710
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Computability and Complexity Theory
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 4213043
Quantité disponible : Plus de 20 disponibles