Descriptive Complexity

Neil Immerman

ISBN 10: 1461268095 / ISBN 13: 9781461268093

Published by Springer New York Sep 2012, 2012

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises. 288 pp. Englisch.

Seller Inventory # 9781461268093

Bibliographic Details

• Title: Descriptive Complexity
• Publisher: Springer New York Sep 2012
• Publication Date: 2012
• Language: English
• ISBN 10: 1461268095
• ISBN 13: 9781461268093
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 16D millimeters 235 millimeters width by 155 millimeters height by 16 millimeters depth
• Weight: 441 grams

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.