Theoretical computer science : introduction to Automata, computability, complexity, algorithmics, randomization, communication, and cryptography
Author(s)
Bibliographic Information
Theoretical computer science : introduction to Automata, computability, complexity, algorithmics, randomization, communication, and cryptography
(Texts in theoretical computer science, An EATCS series)
Springer, c2004
Available at 17 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. [305]-308) and index
Description and Table of Contents
Description
Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author 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.
Table of Contents
- Introduction
- Alphabets, Words, Languages and Algorithmic Problems
- Finite Automata
- Turing Machines
- Computability
- Complexity Theory
- Algorithmics for Hard Problems
- Randomization
- Communication and Cryptography
- References.
by "Nielsen BookData"