Descriptive Complexity

Neil Immerman

ISBN 10: 1461268095 / ISBN 13: 9781461268093

Edité par Springer New York Sep 2012, 2012

A propos de cet article

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.

N° de réf. du vendeur 9781461268093

Détails bibliographiques

• Titre: Descriptive Complexity
• Éditeur: Springer New York Sep 2012
• Date de parution: 2012
• Langue: anglais
• ISBN à 10 chiffres: 1461268095
• ISBN à 13 chiffres: 9781461268093
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 235 L x 155 H x 16 P (en millimètres) 235 millimètres de largeur par 155 millimètres de hauteur par 16 millimètres de profondeur
• Poids: 441 grammes

A propos de ce titre

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.