Verwandte Artikel zu Descriptive Complexity (Texts in Computer Science)

Descriptive Complexity (Texts in Computer Science) - Softcover

 
9781461268093: Descriptive Complexity (Texts in Computer Science)

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Gratis für den Versand innerhalb von/der Deutschland

Versandziele, Kosten & Dauer

Weitere beliebte Ausgaben desselben Titels

9780387986005: Descriptive Complexity (Texts in Computer Science)

Vorgestellte Ausgabe

ISBN 10:  0387986006 ISBN 13:  9780387986005
Verlag: Springer, 1999
Hardcover

Suchergebnisse für Descriptive Complexity (Texts in Computer Science)

Foto des Verkäufers

Neil Immerman
ISBN 10: 1461268095 ISBN 13: 9781461268093
Neu Taschenbuch

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. 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. Artikel-Nr. 9781461268093

Verkäufer kontaktieren

Neu kaufen

EUR 90,94
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Foto des Verkäufers

Neil Immerman
ISBN 10: 1461268095 ISBN 13: 9781461268093
Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9781461268093

Verkäufer kontaktieren

Neu kaufen

EUR 94,06
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Immerman, Neil
Verlag: Springer, 2012
ISBN 10: 1461268095 ISBN 13: 9781461268093
Neu Softcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. In. Artikel-Nr. ria9781461268093_new

Verkäufer kontaktieren

Neu kaufen

EUR 93,80
Währung umrechnen
Versand: EUR 5,73
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb