Get Free Shipping on orders over $79
Descriptive Complexity : Graduate Texts in Computer Science - Neil Immerman

Descriptive Complexity

By: Neil Immerman

Hardcover | 1 January 1999

At a Glance

Hardcover


$199.00

or 4 interest-free payments of $49.75 with

 or 

Ships in 5 to 7 business days

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.

Other Editions and Formats

Paperback

Published: 30th September 2012

More in Set Theory

Tic Tac Test : Beat the Book at Noughts and Crosses - Barry R. Clarke

RRP $399.00

$208.75

48%
OFF
Tic Tac Test : Beat the Book at Noughts and Crosses - Barry R. Clarke
Uncertain Data Analysis : Fuzzy Vector Algorithms - Sansanee Auephanwiriyakul
Uncertain Data Analysis : Fuzzy Vector Algorithms - Sansanee Auephanwiriyakul

RRP $94.99

$85.75

10%
OFF
Complex Analysis - Dennis G. Zill

RRP $564.75

$352.75

38%
OFF
Axiomatic Design : Advances and Applications - Nam Pyo Suh
Future Directions of Fuzzy Theory and Systems - K. S. Leung

RRP $216.99

$195.75

10%
OFF