• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Descriptive Complexity

Descriptive Complexity

Hardcover

Series: Texts in Computer Science

General ComputersNetworking

ISBN10: 0387986006
ISBN13: 9780387986005
Publisher: Springer
Published: Nov 20 1998
Pages: 268
Weight: 1.19
Height: 0.75 Width: 6.41 Depth: 9.58
Language: English
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.

1 different editions

Also available

Also in

General Computers