Descriptive Complexity
(Sprache: Englisch)
By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzing the parallel time needed to compute a query, and the analysis of nondeterministic classes....
Leider schon ausverkauft
versandkostenfrei
Buch
128.39 €
Produktdetails
Produktinformationen zu „Descriptive Complexity “
Klappentext zu „Descriptive Complexity “
By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises.
Inhaltsverzeichnis zu „Descriptive Complexity “
- Introduction- Background in Logic
- Background in Complexity
- First-Order Reductions
- Inductive Definitions
- Parallelism
- Ehrenfeucht-Fraisse Games
- Second-Order Logic and Fagin's Theorem
- Second-Order Lower Bounds
- Complementation and Transitive Closure
- Polynomial Space
- Uniformity and Precomputation
- The Role of Ordering
- Lower Bounds
- Applications
- Conclusions and Future Directions
Bibliographische Angaben
- Autor: Neil Immerman
- 1999, 268 Seiten, 41 Abbildungen, Maße: 16 x 24,2 cm, Gebunden, Englisch
- Verlag: Springer, New York
- ISBN-10: 0387986006
- ISBN-13: 9780387986005
Sprache:
Englisch
Kommentar zu "Descriptive Complexity"
0 Gebrauchte Artikel zu „Descriptive Complexity“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Descriptive Complexity".
Kommentar verfassen