Algorithms and complexity
Author(s)
Bibliographic Information
Algorithms and complexity
（Handbook of theoretical computer science / editor, Jan van Leeuwen, v. A）
MIT Press , Elsevier, 1994
MIT Press paperback edition
- : pbk
Available at 34 libraries
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
by "Nielsen BookData"