Computability and Complexity Theory (Texts in Computer Science)
by Steven Homer and Alan L. Selman
From $87.99 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $85.99 at 100+
Total $2,199.75
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Turn this order into a program
Groups that order together often pair the copies with something more. We handle the extras so you don't have to.
Bookplates, tipped-in pages, belly bands or author signatures. Subject to publisher approval.
Customization options Ship to every readerOne address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment options Pair it with a branded journalJournals with your logo or each reader's name, for the same group.
Branded journalsBookPal is partnering with Talezo to help you find and book authors, speakers and performers for your event.
BookPal × TalezoComputability and Complexity Theory (Texts in Computer Science)
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
Details
- Publisher
- Springer US
- Authors
- Steven Homer, Alan L. Selman
- Format
- Hardcover
- Published
- Dec 9, 2011
- ISBN-13
- 9781461406815
- Pages
- 300
- Printing
- Printed on demand
Computability and Complexity Theory (Texts in Computer Science) for groups: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $87.99 | 12% off list |
| 50 – 99 | $86.99 | 13% off list |
| 100+ | $85.99 | 14% off list |
Popular for
A copy for every member, on one order.
A book for every attendee, delivered to your venue.
For clients, staff, members or volunteers.
Where can I buy 100 copies of Computability and Complexity Theory?
BookPal sells Computability and Complexity Theory in quantity. At 100 copies the price is $85.99 a copy, against a list price of $99.99, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.
- New books only, straight from the publisher
- Volume prices apply automatically in the cart, with no code needed
- Order at least 10 business days before you need the books (11 from mid-November through December)
What does Computability and Complexity Theory (Texts in Computer Science) cost when I buy for a group?
Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $87.99 (12% off list); 50 to 99 copies, $86.99 (13% off list); 100+ copies, $85.99 (14% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.
How fast can I get copies of Computability and Complexity Theory (Texts in Computer Science)?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Computability and Complexity Theory (Texts in Computer Science)
Groups also order




A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.