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.75

or 4 interest-free payments of $49.94 with

 or 

Ships in 7 to 10 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 Computer Architecture & Logic Design

Basic Computer Architecture - Earl Bermann
Building Microservices : Designing Fine-Grained Systems 2nd Edition - Sam Newman
Computer Systems 3ed : A Programmer's Perspective, Global Edition - David O'Hallaron
Simply AI : Facts Made Fast - DK

RRP $22.99

$20.75

10%
OFF
Developing Graphics Frameworks with Java and OpenGL - Lee Stemkoski
System Design on AWS : Building and Scaling Enterprise Solutions - Jayanth Kumar
The Designer's Guide to VHDL, third edition : Volume 3 - Peter Ashenden
Digital Design and Computer Architecture : ARM Edition - Sarah Harris
Quantum Computing : Research, Applications, and Advances - Arun Sekar Rajasekaran
Quantum Machine Learning : Concepts, Algorithms, and Applications - Syed Nisar Hussain Bukhari
Quick Data Structures : Quick Programming - David Matuszek