Limits of Computation: An Introduction to the Undecidable and the Intractable by Reiter, Edna E.

Limits of Computation: An Introduction to the Undecidable and the Intractable (Hardcover) (ISBN-13: 9781439882061)

Vendor: Edna E. Reiter
Product type: Books
Format: Hardcover
$130.00
$130.00
$130.00
Subtotal: $130.00
Limits of Computation: An Introduction to the Undecidable and the Intractable by Reiter, Edna E.

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

$130.00
Limits of Computation: An Introduction to the Undecidable and the Intractable by Reiter, Edna E.

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

$130.00
Format: Hardcover
Description
Description
x

Developed from the authors' course on computational complexity theory, this book 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 text assumes no prior knowledge of automata, advanced algorithmic analysis, and formal languages. Each chapter presents the fundamentals, examples, complete proofs of theorems, and a wide range of exercises. PowerPoint slides are available for download at www.crcpress.com.



Author: Edna E. Reiter, Clayton Matthew Johnson
ISBN-10: 1439882061
ISBN-13: 9781439882061
Publisher: CRC Press
Language: English
Published: 10/29/2012
Pages: 279
Format: Hardcover
Weight: 1.25lbs
Size: 9.30h x 6.30w x 0.90d

Review Citation(s):
Choice 06/01/2013
By Edna E. Reiter
By Edna E. Reiter
x

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.

Recently Viewed Products