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

$$ Buy "Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Ran" on Amazon $$

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. Handbook of Theoretical Computer Science : Algorithms and Complexity
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. An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
9. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity
10. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic)
11. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic)
12. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic)
13. Computability and Complexity: From a Programming Perspective (Foundations of Computing)
14. Lectures on the Complexity of Bilinear Problems (Lecture Notes in Computer Science)
15. Theoretical Computer Science: Essays in Memory of Shimon Even
16. Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)