Theoretical Computer Science : Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Juraj Hromkovi¿

ISBN 10: 3540140158 / ISBN 13: 9783540140153

Edité par Springer Berlin Heidelberg, 2003

A propos de cet article

Zustand: Hervorragend | Seiten: 332 | Sprache: Englisch | Produktart: Bücher.

N° de réf. du vendeur 1419875/1

Détails bibliographiques

• Titre: Theoretical Computer Science : Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
• Éditeur: Springer Berlin Heidelberg
• Date de parution: 2003
• Langue: anglais
• ISBN à 10 chiffres: 3540140158
• ISBN à 13 chiffres: 9783540140153
• Reliure: Couverture rigide
• État de l'article: Hervorragend

A propos de ce titre

Synopsis

This textbook provides an elegant route through the theoretical fundamentals of computer science. In doing so, it shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design.

À propos de l?auteur

Also Author of our books "Communication Complexity and Parallel Computing", 57459-X and "Algorithmics for Hard Problems" 2nd ed., 44134-4; Advisory Board member of the EATCS series.