Order Total (1 Item Items):
Shipping Destination:
Computability Complexity Theory by Homer Steven (26 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (26)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (22)
- As New, Fine or Near Fine (3)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (14)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Computability and Complexity Theory
Book 30 of 83: Texts in Computer ScienceLanguage: English
Published by Springer-Verlag New York Inc., 2001
ISBN 10: 0387950559 ISBN 13: 9780387950556
£ 5.82 10% off£ 5.24
£ 14.37 shipping
Ships from France to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Très bon. Ancien livre de bibliothèque. Edition 2001. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2001. Ammareal gives back up to 15% of this item's net price to charity organizations.
-
Computability and Complexity Theory
Book 30 of 83: Texts in Computer ScienceSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 45.35
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Hardcover. Condition: 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!
-
Computability and Complexity Theory (Texts in Computer Science)
Book 22 of 83: Texts in Computer ScienceSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 80.91
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Computability and Complexity Theory (Texts in Computer Science)
Book 22 of 83: Texts in Computer ScienceSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 80.91
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: New. pp. 316.
-
Condition: New. pp. 316 2nd Edition.
-
-
Gebunden. Condition: New.
-
Computability and Complexity Theory
Book 22 of 83: Texts in Computer ScienceLanguage: English
Published by Springer-Verlag New York Inc, 2011
ISBN 10: 1461406811 ISBN 13: 9781461406815
Hardcover. Condition: Brand New. 2nd edition. 298 pages. 9.25x6.00x1.00 inches. In Stock.
-
Taschenbuch. Condition: Neu. Computability and Complexity Theory | Steven Homer (u. a.) | Taschenbuch | Texts in Computer Science | xvi | Englisch | 2014 | Humana | EAN 9781489989710 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
paperback. Condition: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Computability and Complexity Theory
Book 30 of 83: Texts in Computer ScienceLanguage: English
Published by Springer Nature B.V., 2013
ISBN 10: 1475735456 ISBN 13: 9781475735451
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Computability and Complexity Theory
Book 30 of 83: Texts in Computer ScienceLanguage: English
Published by Springer Nature B.V., 2013
ISBN 10: 1475735456 ISBN 13: 9781475735451
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
£ 45.45
£ 4.16 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Condition: new. Questo è un articolo print on demand.
-
Condition: new. Questo è un articolo print on demand.
-
Computability and Complexity Theory
Book 22 of 83: Texts in Computer ScienceLanguage: English
Published by Springer-Verlag New York Inc., 2014
ISBN 10: 1489989714 ISBN 13: 9781489989710
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 94.70
£ 15.91 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Condition: New. Print on Demand pp. 316 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Computability and Complexity Theory
Book 22 of 83: Texts in Computer ScienceLanguage: English
Published by Springer-Verlag New York Inc., 2011
ISBN 10: 1461406811 ISBN 13: 9781461406815
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 94.70
£ 17.42 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Condition: New. Print on Demand pp. 316 50 Illus.
-
Condition: New. PRINT ON DEMAND pp. 316.
-
Condition: New. PRINT ON DEMAND pp. 316.
-
Computability and Complexity Theory
Book 22 of 83: Texts in Computer ScienceLanguage: English
Published by Springer, Humana Mär 2014, 2014
ISBN 10: 1489989714 ISBN 13: 9781489989710
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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 KG, Sachsenplatz 4-6, 1201 Wien 316 pp. Englisch.
-
Computability and Complexity Theory
Book 22 of 83: Texts in Computer ScienceLanguage: English
Published by Springer, Springer Dez 2011, 2011
ISBN 10: 1461406811 ISBN 13: 9781461406815
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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 purposesLibri GmbH, Europaallee 1, 36244 Bad Hersfeld 316 pp. Englisch.
