Theoretical Computer Science: Introduction to Automata, Computability, Complexit
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography (Texts in Theoretical Computer Science. An EATCS Series)
Publisher:Springer
Number Of Pages:313
Publication Date:2003-11-05
Sales Rank:123628
ISBN / ASIN:3540140158
EAN:9783540140153
Binding:Hardcover
Manufacturer:Springer
Studio:Springer
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 thinking: 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.
related link：
-
Theoretical Computer Science Fundamentals Of Computer Science Elegant Route Classic Areas Science Introduction Computer Scientist Theoretical Fundamentals Algorithmics Fundamentals Of Computer Randomization Publisher Springer Fundamental Concepts Cryptogr
- More infomation may be in the description section, read description carefully!
- Click "Ebook Search" button to find mirrors if no download links or dead links in the description.