Models of Computation Exploring the Power of Computing
List price: $84.00
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
Description: 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.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $84.00
Copyright year: 1998
Publisher: Addison-Wesley Longman, Incorporated
Publication date: 10/16/1997
Size: 8.00" wide x 9.75" long x 1.75" tall
|Overview of the Book|
|The Role of Theory In Computer Science|
|A Brief History of Theoretical Computer Science|
|Methods of Proof|
|General Computational Models|
|Straight-Line Programs and Circuits|
|Normal-Form Expansions of Boolean Functions|
|Reductions Between Functions|