Descriptive Complexity (Texts in Computer Science) - Softcover

Book 4 of 83: Texts in Computer Science

Immerman, Neil

 
9781461268093: Descriptive Complexity (Texts in Computer Science)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title

9780387986005: Descriptive Complexity (Texts in Computer Science)

Featured Edition

ISBN 10:  0387986006 ISBN 13:  9780387986005
Publisher: Springer, 1998
Hardcover