Hot Best Seller

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Availability: Ready to download

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 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.


Compare

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 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.

30 review for Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

  1. 4 out of 5

    Juris

    The introduction of this book is one of the few reasons I’m still in my degree program. Invitation to the Dance, Op. 65 by Weber as played by the Berlin Philharmonic with Herbert von Karajan.

  2. 4 out of 5

    John

  3. 5 out of 5

    Hira nawaz

  4. 5 out of 5

    Rita

  5. 5 out of 5

    Erik

  6. 5 out of 5

    Durga

  7. 4 out of 5

    Subhajit Das

  8. 5 out of 5

    Vincent Russo

  9. 4 out of 5

    ·

  10. 5 out of 5

    Beat Honegger

  11. 5 out of 5

    Subhayan Roy moulick

  12. 5 out of 5

    Sathish

  13. 5 out of 5

    Monika

  14. 5 out of 5

    Gomathissp

  15. 4 out of 5

    Paul Siersma

  16. 5 out of 5

    Laila Jan

  17. 5 out of 5

    BookDB

  18. 4 out of 5

    Manisha

  19. 5 out of 5

    Joseph

  20. 5 out of 5

    Mohammad Zeineldeen

  21. 5 out of 5

    Elias Haddad

  22. 4 out of 5

    Azzaz Ibrahim

  23. 4 out of 5

    Lou

  24. 4 out of 5

    Aaron

  25. 4 out of 5

    Vne Cuoly

  26. 4 out of 5

    Arthur

  27. 5 out of 5

    Krzysiek (Chris)

  28. 4 out of 5

    Brian

  29. 4 out of 5

    Kaiser

  30. 4 out of 5

    Adam Elkus

Add a review

Your email address will not be published. Required fields are marked *

Loading...