Descriptive Complexity
About
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.
Discuss Descriptive Complexity with other readers
Join or start a book club for Descriptive Complexity on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Descriptive Complexity?
Sign up free on Readfeed, then browse public clubs or start your own club with Descriptive Complexity as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Descriptive Complexity with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Descriptive Complexity with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.