A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. 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. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.
| Autorius: | Neil Immerman |
| Serija: | Texts in Computer Science |
| Leidėjas: | Springer New York |
| Išleidimo metai: | 2012 |
| Knygos puslapių skaičius: | 288 |
| ISBN-10: | 1461268095 |
| ISBN-13: | 9781461268093 |
| Formatas: | Knyga minkštu viršeliu |
| Kalba: | Anglų |
| Žanras: | Mathematical logic |
Parašykite atsiliepimą apie „Descriptive Complexity“
