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

Description

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

Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Ran" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 1078
2. [request_ebook] Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
3. Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
4. Kolmogorov Complexity and Computational Complexity (E a T C S Monographs on Theoretical Computer Science): Osamu Watanabe
5. Handbook of Theoretical Computer Science : Algorithms and Complexity
6. Handbook of Theoretical Computer Science : Algorithms and Complexity
7. Handbook of Theoretical Computer Science : Algorithms and Complexity
8. Handbook of Theoretical Computer Science : Algorithms and Complexity
9. Structural Complexity I (Texts in Theoretical Computer Science. An EATCS Series)
10. An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
11. An Introduction to Kolmogorov Complexity and Its Applications, 3rd ed. (Texts in Computer Science)
12. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity
13. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic)
14. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic)
15. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic)
16. Computability, Complexity, Logic