Descriptive Complexity

Neil Immerman

ISBN 10: 1461268095 / ISBN 13: 9781461268093

Verlag: Springer New York, Springer New York Sep 2012, 2012

Beschreibung

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 288 pp. Englisch.

Bestandsnummer des Verkäufers 9781461268093

Bibliografische Details

• Titel: Descriptive Complexity
• Verlag: Springer New York, Springer New York Sep 2012
• Erscheinungsjahr: 2012
• Sprache: Englisch
• ISBN-10: 1461268095
• ISBN-13: 9781461268093
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 235B x 155 H x 16 T Millimeter Breite: 235 mm, Höhe: 155 mm, Tiefe: 16 mm
• Gewicht: 441 Gramm

Über diesen Titel

Inhaltsangabe

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.

Reseña del editor

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.