Date : 2006
Type : Livre / Book
Langue / Language : anglais / English
ISBN : 1-84628-297-7
ISBN : 978-1-84628-297-3
EAN : 9781846282973
Complexité de calcul (informatique)
Automates mathématiques, Théorie des
Décidabilité (logique mathématique)
Classification Dewey : 511.352
Collection : Texts in computer science / New York : Springer
Relation : Theory of Computation / by Dexter C. Kozen. / 1st ed. 2006. / London : Springer London , 2006
Résumé / Abstract : This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer science and also provides an introduction to some more advanced topics for those intending further study in the area. This innovative text focuses primarily on computational complexity theory: the classification of computational problems in terms of their inherent complexity. The book contains an invaluable collection of lectures for first-year graduates on the theory of computation. Topics and features include more than 40 lectures for first year graduate students, and a dozen homework sets and exercises