Tech@Addebook

Free Ebook download Library
search in addebook

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Ran

By addebook • Jun 28th, 2008 • Category: Engineer Get in Amazon

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.

http://rapidshare.com/files/41913109/short-_Hromkovic__Theoretical_Computer_Science.pdf.html

Related Posts


    Get in Amazon

Tagged as:

Leave a Reply

You must be logged in to post a comment.