Better Together
Customers Who Bought This Item Also Bought
Introduction to the Theory of Computation, Second Edition by Michael Sipser  (51)
$140.95
|
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by M. R. Garey  (13)
$41.26
|
Algorithmic Game Theory by Noam Nisan
$36.00
|
Introduction to Automata Theory, Languages, and Computation (3rd Edition) by John E. Hopcroft  (41)
$123.00
|
Computational Complexity by Christos H. Papadimitriou  (14)
$73.00
|
From the reviews:
"This book represents the lecture notes of Dexter Kozen for the first-year graduate students in computer science at Cornell University. The book contains 41 primary lectures and 10 supplementary lectures covering more specialized and advanced topics. There are also 12 homework sets and several miscellaneous homework exercises many with hints and complete solutions. there is a bibliography of 127 titles. The book contains a very useful list of notations and abbreviations and an index." (Daniela Marinescu, Zentralblatt MATH, Vol. 1102 (4), 2007)
"The book is a collection of lecture notes based on a one-semester course for first-year graduate students in computer science at Cornell . The course serves a dual purpose: to cover material in the foundations of computing for graduate students in computer science preparing for their Ph.D. qualifying exams, and to provide an introduction to some more advanced topics in the theory of computational complexity for those intending to pursue further study in the area." (Ulrich Tamm, Mathematical Reviews, Issue 2007 f)
"This textbook covers topics essential to the theory of computation. In short, this is an interesting and enjoyable book that is strongly recommended to people who appreciate accuracy and concision. It will surely be an important textbook on the theory of computation for years to come. The intended audience is advanced undergraduate and first-year graduate students in computer science. It could also be useful to computer scientists with an interest in the foundation of computing and computational complexity." (G. Ciobanu, Computing Reviews, Vol. 49 (5), May, 2008)
Product Description
This textbook has been written with the dual purpose to cover core material in the foundations of computing for graduate students in computer science, as well as to provide an introduction to some more advanced topics for those intending further study in the area.
This book contains an invaluable collection of lectures for first-year graduates on the theory of computation, focusing primarily on computational complexity theory. Topics and features include:
- Organization into self-contained lectures of 3-7 pages;
- 41 primary lectures and a handful of supplementary lectures covering more specialized or advanced topics;
- 12 homework sets and several miscellaneous homework exercises of varying levels of difficulty, many with hints and complete solutions.
Aimed at advanced undergraduates and first-year graduates in Computer Science or Mathematics with an interest in the theory of computation and computational complexity, this book provides a thorough grounding the foundations of computational complexity theory.
Product Details
|
See all 2 customer reviews...