Articles liés à Descriptive Complexity
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 120,69
EUR 2,28 expédition vers Etats-Unis
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Descriptive Complexity
Image fournie par le vendeur
Descriptive Complexity
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 672679-n
Quantité disponible : 15 disponible(s)
Image d'archives
Descriptive Complexity (Hardcover)
Edité par
Springer-Verlag New York Inc., New York, NY, 1998
ISBN 10 : 0387986006
ISBN 13 : 9780387986005
Neuf
Couverture rigide
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780387986005
Quantité disponible : 1 disponible(s)
Image d'archives
Descriptive Complexity (Texts in Computer Science)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580175412
Quantité disponible : Plus de 20 disponibles
Image d'archives
Descriptive Complexity (Texts in Computer Science)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9780387986005
Quantité disponible : Plus de 20 disponibles
Image d'archives
Descriptive Complexity (Texts in Computer Science)
Vendeur : BennettBooksLtd, San Diego, NV, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
hardcover. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-0387986006
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Descriptive Complexity
Edité par
Springer, 1998
ISBN 10 : 0387986006
ISBN 13 : 9780387986005
Ancien ou d'occasion
Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 672679
Quantité disponible : 15 disponible(s)
Image d'archives
Descriptive Complexity (Texts in Computer Science)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780387986005_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Descriptive Complexity
Edité par
Springer New York, 1998
ISBN 10 : 0387986006
ISBN 13 : 9780387986005
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Gebunden. Etat : New. Self-contained introduction to a fundamental area in computer science Provides readers with an understanding of logic and complexity Explores applications and future directions Includes numerous examples and exercises to further illustrate the ideas present. N° de réf. du vendeur 5913397
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Descriptive Complexity
Edité par
Springer New York Nov 1998, 1998
ISBN 10 : 0387986006
ISBN 13 : 9780387986005
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780387986005
Quantité disponible : 2 disponible(s)
Image d'archives
Descriptive Complexity (Hardcover)
Edité par
Springer-Verlag New York Inc., New York, NY, 1998
ISBN 10 : 0387986006
ISBN 13 : 9780387986005
Neuf
Couverture rigide
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9780387986005
Quantité disponible : 1 disponible(s)