Descriptive Complexity (Hardcover, 1999 ed.)

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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Texts in Computer Science
Release date:	November 1998
First published:	1999
Authors:	Neil Immerman
Dimensions:	235 x 155 x 17mm (L x W x T)
Format:	Hardcover
Pages:	268
Edition:	1999 ed.
ISBN-13:	978-0-387-98600-5
Categories:	Books > Science & Mathematics > Mathematics > General Books > Computing & IT > General theory of computing > Mathematical theory of computation Promotions
LSN:	0-387-98600-6
Barcode:	9780387986005

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!