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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Seller: UK BOOKS STORE, London, LONDO, United Kingdom
Condition: 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. Seller Inventory # CBS 9780387986005
Quantity: 1 available
Seller: URW Books Store, CASPER, WY, U.S.A.
Condition: 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. Seller Inventory # CBSBOOKS38051
Quantity: 1 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780387986005_new
Quantity: Over 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 611. Seller Inventory # C9780387986005
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Condition: 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. Seller Inventory # 5913397
Quantity: Over 20 available
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0387986006
Quantity: 1 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2215580175412
Quantity: Over 20 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: 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. Seller Inventory # 9780387986005
Quantity: 2 available