Tallenna
Descriptive Complexity
By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes.
- Kirjailija
- Neil Immerman
- Painos
- Softcover reprint of the original 1st ed. 1999
- ISBN
- 9781461268093
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 30.9.2012
- Kustantaja
- Springer-Verlag New York Inc.
- Sivumäärä
- 268
