Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Für diesen Artikel ist leider kein Bild verfügbar.

Theories of Computational Complexity

(Autor)

Buch | Hardcover
486 Seiten
1988
North-Holland (Verlag)
978-0-444-70356-9 (ISBN)
CHF 72,90 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before.In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and constructions. The lists of exercises and problems include routine exercises, interesting results, as well as some open problems.

Primitive Recursive Hierarchies. Examples. Ackermann-Peter's Hierarchy. Primitive Recursive Functions. Primitive Recursive Invariants. Primitive Recursive Enumerations. Sudan's Hierarchy. Universal Sequences of Primitive Recursive Functions. Primitive Recursive String-Functions. History. Exercises and Problems.Recursive Functions. Examples. Arithmetization of Computation: An Example. Equational Characterization of Partial Recursive Functions. Godel Numberings. Recursively Enumerable Sets. Undecidability and Independence. Uniformity. Operators. Recursive Real Numbers. History. Exercises and Problems.Blum's Complexity Theory. Examples. Blum Spaces. Recursive Dependence of Complexity Measures. Complexity Classes. The Speed-Up Phenomenon. The Union Theorem. Hard Recursive Functions. Complexity Sequences. A Topological Analysis. History. Exercises and Problems.Kolmogorov and Martin-Lof's Complexity Theory. Examples. Kolmogorov's Complexity. Martin-Lof Tests. Undecidability Theorems. Representability Theorems. Recursive Martin-Lof Tests. Infinite Oscillations. Probabilistic Algorithms. History. Exercises and Problems.Subrecursive Programming Hierarchies. Examples. The LOOP Language. LOOP Hierarchies. A Universal Language. A Dynamic Characterization of LOOP Classes. Augmented LOOP Languages. Simple Functions. Program Size. History. Exercises and Problems. Bibliography. Indexes.

Erscheint lt. Verlag 1.1.1988
Reihe/Serie Annals of Discrete Mathematics
Sprache englisch
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Finanz- / Wirtschaftsmathematik
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-444-70356-X / 044470356X
ISBN-13 978-0-444-70356-9 / 9780444703569
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Teil 2 der gestreckten Abschlussprüfung : Fachinformatiker-/in …

von Dirk Hardy; Annette Schellenberg; Achim Stiefel

Buch | Softcover (2023)
Europa-Lehrmittel (Verlag)
CHF 34,90