Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration
Arnaud Durand · 2020
This paper is devoted to a complexity study of various tasks related to query answering such as deciding if a Boolean query is true or not, counting the size of the answer set or enumerating the results. It is a survey of some of the many tools from complexity measures trough algorithmic methods to conditional lower bounds that have been designed in the domain over the last years.