Posted by **interes** at Nov. 21, 2015

English | ISBN: 113318779X | 2012 | PDF | 480 pages | 10.2 MB

Posted by **Veslefrikk** at Dec. 19, 2014

Publisher: P.W.S Pub 1997 | 396 Pages | ISBN: 053494728X | DJVU | 4 MB

Posted by **ChrisRedfield** at June 13, 2014

Published: 2005-02-15 | ISBN: 0534950973, 8131501620 | PDF + DJVU | 456 pages | 27 MB

Posted by **nebulae** at Dec. 30, 2013

English | ISBN: 113318779X, 1133187811 | 2012 | PDF | 480 pages | 5 MB

Posted by **Grev27** at Feb. 2, 2013

English | ISBN: 113318779X | edition 2012 | PDF | 480 pages | 10.2 MB

Posted by **elodar** at Nov. 25, 2012

English | 2005-02-15 | ISBN: 0534950973 | 440 pages | PDF | 20.7 mb

Posted by **Specialselection** at Oct. 30, 2012

English | 1996-12-13 | ISBN: 053494728X | 410 pages | DJVU | 3.5 mb

Posted by **lenami** at Jan. 17, 2012

Publisher: Course Technology | ISBN: 0534950973 | edition 2005 | PDF | 453 pages | 34Б7 mb

“Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory – including an entire chapter on space complexity.

Posted by **lout** at May 3, 2011

Publisher: P.W.S Pub 1997 | 396 Pages | ISBN: 053494728X | DJVU | 4 MB

Posted by **anonx** at Oct. 31, 2006

February 15, 2005 | ISBN: 0534950973 | DjVu | 456 Pages | 6,57 MB

“Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory – including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.”