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.
Handbook of Theoretical Computer Science: Algorithms and Complexity
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
30 review for Handbook of Theoretical Computer Science: Algorithms and Complexity
Related products
Charles Dickens: The Complete Novels + A Christmas Carol
Discourse on Metaphysics/The Monadology
The Lion and the Unicorn: Socialism and the English Genius
Beware of Pity (New York Review Books Classics)
Where Angels Fear to Tread
White Stains - Anaïs Nin & Friends
Around the World in 80 Days
John –
Andrew –
Brian Ball –
James Mccarron –
Randy –
Wikimedia Italia –
David –
Shannon –
Jaime Arias Almeida –
Rado –
Bismillah Hossainy –
David Marrero –
Josep-Angel Herrero Bajo –
Fotis Koutoulakis –
Stewart Morgan –
K. –
Arun –
Serch –
Eric Soderstrom –
Richard Liu –
Duong Thu –
Pell Ider –
T –
Jamie Bradford –
Matti Andreas –
Chao Chen –
Teodor Đorđević –
Human –
Killian –
Adrian Leo –