Edna E Reiter, Clayton Matthew Johnson

Limits of Computation

An Introduction to the Undecidable and the Intractable

• Gebundenes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis Ltd (Sales)
• Seitenzahl: 279
• Erscheinungstermin: 29. Oktober 2012
• Englisch
• Abmessung: 236mm x 160mm x 23mm
• Gewicht: 567g
• ISBN-13: 9781439882061
• ISBN-10: 1439882061
• Artikelnr.: 36151560

Autorenporträt

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.

Inhaltsangabe

Introduction. Set Theory. Languages: Alphabets, Strings, and Languages.
Algorithms. Turing Machines. Turing-Completeness. Undecidability.
Undecidability and Reducibility. Classes NP and NP-Complete. More
NP-Complete Problems. Other Interesting Questions and Classes.
Bibliography. Index.