Approximately counting answers to conjunctive queries with disequalities and negations
<p>We study the complexity of approximating the number of answers to a small query 𝜑 in a large database D. We establish an exhaustive classification into tractable and intractable cases if 𝜑 is a conjunctive query possibly including disequalities and negations:</p> <br> <p>•...
| Huvudupphovsmän: | , , , |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
Association for Computing Machinery
2024
|