Catalogue des ouvrages Université de Laghouat
A partir de cette page vous pouvez :
Détail d'une collection
Collection Texts in computer science
Documents disponibles dans la collection
Ajouter le résultat dans votre panier Faire une suggestion Affiner la recherche
| Titre : | Theory of computation | | Type de document : | texte imprimé | | Auteurs : | Dexter Kozen, Auteur | | Editeur : | Newyork;Paris;Milan;Berlin;Londres;Amsterdam [Usa;France;Italie;Allemagne;Engleterre;Hollande] : Springer | | Année de publication : | 2006 | | Collection : | Texts in computer science | | Importance : | 418p. | | Présentation : | ill. | | Format : | 25 cm | | ISBN/ISSN/EAN : | 978-1-84628-297-3 | | Langues : | Anglais | | Catégories : | INFORMATIQUE:004.1generalite,dictionnaire,...
| | Mots-clés : | Complexité de calcul (informatique ) Informatique Mathématiques Problèmes et exercices | | Résumé : | 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. |
Theory of computation [texte imprimé] / Dexter Kozen, Auteur . - Newyork;Paris;Milan;Berlin;Londres;Amsterdam (Usa;France;Italie;Allemagne;Engleterre;Hollande) : Springer, 2006 . - 418p. : ill. ; 25 cm. - ( Texts in computer science) . ISBN : 978-1-84628-297-3 Langues : Anglais | Catégories : | INFORMATIQUE:004.1generalite,dictionnaire,...
| | Mots-clés : | Complexité de calcul (informatique ) Informatique Mathématiques Problèmes et exercices | | Résumé : | 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. |
|  |
Réservation
Réserver ce document
Exemplaires
| Disponibilité |
|---|
| 004.1.42-1 | 004.1.42-1 | Livre interne | BIBLIOTHEQUE CENTRALE | Informatique (bc) | Disponible |
| 511.3-31-1 | 511.3-31-1 | Livre externe | BIBLIOTHEQUE DE FACULTE DES SCIENCES | Mathématique (SCI) | Disponible |
