Hot Best Seller

Handbook of Theoretical Computer Science: Algorithms and Complexity

Availability: Ready to download

The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theor The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theory of automata and rewriting systems, the foundations of modern programming languages, and logics for program specification and verification, and presents several studies on the theoretic modeling of advanced information processing. The two volumes contain thirty-seven chapters, with extensive chapter references and individual tables of contents for each chapter. There are 5,387 entry subject indexes that include notational symbols, and a list of contributors and affiliations in each volume.


Compare

The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theor The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theory of automata and rewriting systems, the foundations of modern programming languages, and logics for program specification and verification, and presents several studies on the theoretic modeling of advanced information processing. The two volumes contain thirty-seven chapters, with extensive chapter references and individual tables of contents for each chapter. There are 5,387 entry subject indexes that include notational symbols, and a list of contributors and affiliations in each volume.

30 review for Handbook of Theoretical Computer Science: Algorithms and Complexity

  1. 5 out of 5

    John

  2. 5 out of 5

    Andrew

  3. 4 out of 5

    Brian Ball

  4. 4 out of 5

    James Mccarron

  5. 5 out of 5

    Randy

  6. 5 out of 5

    Wikimedia Italia

  7. 4 out of 5

    David

  8. 5 out of 5

    Shannon

  9. 4 out of 5

    Jaime Arias Almeida

  10. 4 out of 5

    Rado

  11. 5 out of 5

    Bismillah Hossainy

  12. 5 out of 5

    David Marrero

  13. 5 out of 5

    Josep-Angel Herrero Bajo

  14. 5 out of 5

    Fotis Koutoulakis

  15. 5 out of 5

    Stewart Morgan

  16. 4 out of 5

    K.

  17. 4 out of 5

    Arun

  18. 4 out of 5

    Serch

  19. 5 out of 5

    Eric Soderstrom

  20. 5 out of 5

    Richard Liu

  21. 5 out of 5

    Duong Thu

  22. 5 out of 5

    Pell Ider

  23. 5 out of 5

    T

  24. 5 out of 5

    Jamie Bradford

  25. 4 out of 5

    Matti Andreas

  26. 4 out of 5

    Chao Chen

  27. 5 out of 5

    Teodor Đorđević

  28. 4 out of 5

    Human

  29. 4 out of 5

    Killian

  30. 5 out of 5

    Adrian

Add a review

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

Loading...