Descriptive Complexity (Texts in Computer Science)

Immerman, Neil

ISBN 10: 0387986006 / ISBN 13: 9780387986005

Published by Springer, 1998

About this Item

A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.

Seller Inventory # OTV.0387986006.G

Bibliographic Details

• Title: Descriptive Complexity (Texts in Computer Science)
• Publisher: Springer
• Publication Date: 1998
• Language: English
• ISBN 10: 0387986006
• ISBN 13: 9780387986005
• Binding: Hardcover
• Condition: good

About this title

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.