Descriptive Complexity (Texts in Computer Science)
Sold by Ergodemedia, an authorized reseller of Authentic New & Used Books with Free US Shipping.
30-day returns by mail · Refunded to original payment method | support@ergodemedia.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch via USPS / UPS
- Securely packed to ensure your book arrives in the described condition
- Tracking number sent via email once dispatched
- Taxes calculated at checkout. International shipping not available.
Returns & Refund
Returns accepted within 30 days of delivery. Returns are processed by mail. Refunds are issued to the original payment method within 5–7 business days of receiving the returned item.
Damaged, Defective or Misrepresented Item
Free return shipping by mail · Full refund to original payment method
Wrong Item Received
Free return shipping by mail · Full refund or replacement at your choice
Change of Mind
Return shipping at customer's expense · Book must be in the same condition as received · Refund to original payment method
Safety & Compliance
California Proposition 65 Warning
Some products sold on this website may expose you to chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
www.P65Warnings.ca.govBook Condition & Care Notice
Used books are graded and described accurately — condition details are listed on each product page. Books may contain previous owner's handwriting, highlights, or stamps unless stated as new. Store books away from direct sunlight and moisture to preserve their condition.
New books are sealed or unread. Used books are inspected before dispatch.
Product Authenticity & Notice
All books sold by Ergodemedia are 100% authentic, sourced directly from publishers and trusted distributors. Book condition is accurately graded and described. Some books may contain previous owner's markings or inscriptions.
Ergodemedia — Authentic New & Used Books. Free US Shipping. Delivered to Your Door.
Description
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 firstorder 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 selfcontained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.
Shop The Full Collection