SPRINGER INDIA Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography - Softcover

Book 12 of 45: Texts in Theoretical Computer Science. An EATCS

HROMKOVIC JURAJ

  • 3.57 out of 5 stars
    7 ratings by Goodreads
 
9788184896053: SPRINGER INDIA Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Synopsis

This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, depth of research, and yet directly applicable. It presents the development of the computer scientist's way of detailing such classic areas as computability and automata theory as well as such fundamental concepts as approximation and randomization in algorithmics. Coverage also explains the basic ideas of cryptography and interconnection network design.Content Level ?? Research Keywords ?? Algorithmics - Communication - Complexity - Computability - Cryptography - Hard problems - Interconnection networks

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title

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

Featured Edition

ISBN 10:  3540140158 ISBN 13:  9783540140153
Publisher: Springer, 2003
Hardcover