The focus of this book is on finite problems and concrete computational models. It covers the traditional topics of formal languages, automata and complexity classes, as well as an introduction to the more modern topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity. These topics are integrated throughout the book as illustrated by the early introduction of P-complete and NP-complete problems. Models of Computation provides the first textbook treatment of space-time tradeoffs and memory hierarchies. It gives a comprehensive introduction to computational complexity as well as a brief but modern coverage of circuit complexity. Parallelism is integrated throughout the book.
- ISBN10 0201895390
- ISBN13 9780201895391
- Publish Date 8 January 1998
- Publish Status Out of Print
- Out of Print 15 March 2021
- Publish Country US
- Imprint Pearson
- Format Paperback
- Pages 600
- Language English