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.
EUR 5,77 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisVendeur : UK BOOKS STORE, London, LONDO, Royaume-Uni
Etat : New. Brand New! Fast Delivery US Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability. N° de réf. du vendeur CBS 9780387986005
Quantité disponible : 1 disponible(s)
Vendeur : URW Books Store, CASPER, WY, Etats-Unis
Etat : Brand New. Brand New! Fast Delivery, Delivery With In 7-10 working Day Only , USA Edition Original Edition. Excellent Quality, Printing In English Language, Quick delivery by FEDEX & DHL. USPS & UPS Act. Our courier service is not available at PO BOX& APO BOX. Ship from India & United States. N° de réf. du vendeur CBSBOOKS38051
Quantité disponible : 1 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9780387986005_new
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
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
Vendeur : BennettBooksLtd, North Las Vegas, NV, Etats-Unis
hardcover. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-0387986006
Quantité disponible : 1 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 611. N° de réf. du vendeur C9780387986005
Quantité disponible : Plus de 20 disponibles
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580175412
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
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)