Computability and Complexity Theory

Language: English

Published by Springer, 2011

1461406811 / 9781461406815

Series: Book 22 of 83 - Texts in Computer Science

  • Softcover
  • New
See all details

Seller: Home-set, Mannheim, GermanyHome-set

5-star seller

AbeBooks seller since April 13, 2026

Softcover

Condition: New

£ 97.67

£ 41.62 shipping 
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket
Free 30-day returns

Item description from seller

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 Sprache: Englisch Gewicht in Gramm: 589.…

Title
Computability and Complexity Theory
Author
Alan L. Selman, Steven Homer
Publisher
Springer
Publication year
2011
Condition
Neu
Binding
Gebundene Ausgabe
Language
English
ISBN 10
1461406811
ISBN 13
9781461406815
Edition
2nd Edition
Item weight
589 grams
Series
Book 22 of 83: Texts in Computer Science

Home-set

Mannheim, Germany

5-star seller

AbeBooks seller since April 13, 2026

Shipping rates from Germany to U.S.A.

Item10 to 12 business days8 to 10 business days
First item£ 41.62£ 62.56
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check

Specialty

Buch

Seller's business information

Home-set

Germany