Delivery included to the United States

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

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

Softcover reprint of hardcover 1st ed. 2011

Paperback (06 Dec 2010)

Save $18.25

  • RRP $123.03
  • $104.78
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation.

An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design.

Book information

ISBN: 9783642057298
Publisher: Springer Berlin Heidelberg
Imprint: Springer
Pub date:
Edition: Softcover reprint of hardcover 1st ed. 2011
DEWEY: 004
DEWEY edition: 22
Language: English
Number of pages: 313
Weight: 504g
Height: 234mm
Width: 156mm
Spine width: 17mm