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>•...
Autori principali: | Focke, J, Goldberg, L, Roth, M, Zivny, S |
---|---|
Natura: | Journal article |
Lingua: | English |
Pubblicazione: |
Association for Computing Machinery
2024
|
Documenti analoghi
-
Approximately counting answers to conjunctive queries with disequalities and negations
di: Focke, J, et al.
Pubblicazione: (2022) -
Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
di: Focke, J, et al.
Pubblicazione: (2024) -
The complexity of approximately counting retractions
di: Focke, J, et al.
Pubblicazione: (2019) -
The complexity of approximately counting retractions
di: Focke, J, et al.
Pubblicazione: (2020) -
The complexity of approximately counting retractions to square-free graphs
di: Focke, J, et al.
Pubblicazione: (2021)