Algorithms and Complexity
Elsevier Science Ltd (Verlag)
978-0-444-88071-0 (ISBN)
Machine Models and Simulations (P. van Emde Boas). A Catalog of Complexity Classes (D.S. Johnson). Machine-Independent Complexity Theory (J.I. Seiferas). Kolmogorov Complexity and its Applications (M. Li, P.M.B. Vitányi). Algorithms for Finding Patterns in Strings (A.V. Aho). Data Structures (K. Mehlhorn, A. Tsakalidis). Computational Geometry (F.F. Yao). Algorithmic Motion Planning in Robotics (J.T. Schwartz, M. Sharir). Average-Case Analysis of Algorithms and Data Structures (J.S. Vitter, Ph. Flajolet). Graph Algorithms (J. van Leeuwen). Algebraic Complexity Theory (V. Strassen). Algorithms in Number Theory (A.K. Lenstra, H.W. Lenstra Jr.). Cryptography (R. Rivest). The Complexity of Finite Functions (R.B. Boppana, M. Sipser). Communication Networks (N. Pippenger). VLSI Theory (Th. Lengauer). Parallel Algorithms for Shared-Memory Machines (R.M. Karp, V. Ramachandran). General Purpose Parallel Architectures (L.G. Valiant). Subject Index.
| Erscheint lt. Verlag | 12.9.1990 |
|---|---|
| Reihe/Serie | Handbook of Theoretical Computer Science |
| Verlagsort | Oxford |
| Sprache | englisch |
| Maße | 175 x 244 mm |
| Gewicht | 1970 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 0-444-88071-2 / 0444880712 |
| ISBN-13 | 978-0-444-88071-0 / 9780444880710 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
