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>•...
主要な著者: | Focke, J, Goldberg, L, Roth, M, Zivny, S |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Association for Computing Machinery
2024
|
類似資料
-
Approximately counting answers to conjunctive queries with disequalities and negations
著者:: Focke, J, 等
出版事項: (2022) -
Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
著者:: Focke, J, 等
出版事項: (2024) -
The complexity of approximately counting retractions
著者:: Focke, J, 等
出版事項: (2019) -
The complexity of approximately counting retractions
著者:: Focke, J, 等
出版事項: (2020) -
The complexity of approximately counting retractions to square-free graphs
著者:: Focke, J, 等
出版事項: (2021)