| Descriptive Complexity 1999 Edition Contributor(s): Immerman, Neil (Author) |
|
 |
ISBN: 0387986006 ISBN-13: 9780387986005 Publisher: Springer OUR PRICE: $123.49 Product Type: Hardcover - Other Formats Published: November 1998 Annotation: By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases. This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises. |
| Additional Information |
| BISAC Categories: - Computers | Logic Design - Computers | Computer Science - Computers | Networking - General |
| Dewey: 511.3 |
| LCCN: 98033563 |
| Series: Graduate Texts in Computer Science |
| Physical Information: 0.75" H x 6.41" W x 9.58" (1.19 lbs) 268 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |