Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Limits of Computation: An Introduction to the Undecidable and the Intractable

by Edna E. Reiter
Save 35% Save 35%
Current price ₹8,716.00
Original price ₹13,409.00
Original price ₹13,409.00
Original price ₹13,409.00
(-35%)
₹8,716.00
Current price ₹8,716.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9781439882061
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Taylor & Francis
  • Publisher Imprint: CRC Press
  • Publication Date:
  • Pages: 279
  • Original Price: GBP 105.0
  • Language: English
  • Edition: N/A
  • Item Weight: 567 grams
  • BISAC Subject(s): Set Theory, Information Theory, and Computer Simulation

Limits of Computation: An Introduction to the Undecidable and the Intractable offers a gentle introduction to the theory of computational complexity. It explains the difficulties of computation, addressing problems that have no algorithm at all and problems that cannot be solved efficiently.

The book enables readers to understand:

  • What does it mean for a problem to be unsolvable or to be NP-complete?
  • What is meant by a computation and what is a general model of a computer?
  • What does it mean for an algorithm to exist and what kinds of problems have no algorithm?
  • What problems have algorithms but the algorithm may take centuries to finish?

Developed from the authors' course on computational complexity theory, the text is suitable for advanced undergraduate and beginning graduate students without a strong background in theoretical computer science. Each chapter presents the fundamentals, examples, complete proofs of theorems, and a wide range of exercises.

Edna E. Reiter, Ph.D., is the current Chair of the Department of Mathematics and Computer Science at California State University, East Bay (CSUEB). Her research interests include noncommutative ring theory and theoretical aspects of computer science.

Clayton Matthew Johnson, Ph.D., is the graduate coordinator for all M.S. students and the incoming Chair of the Department of Mathematics and Computer Science at CSUEB. His research interests include genetic algorithms and machine learning.

Drs. Reiter and Johnson developed the subject matter for the CSUEB Computation and Complexity course, which is required for all students in the computer science M.S. program. The course covers the hard problems of computer science--those that are intractable or undecidable. The material in this book has been tested on multiple sections of CSUEB students.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us