DBScholar

Back to papers

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations

Summary: Dichotomy (FPTRAS) for counting answers to conjunctive queries with disequalities/negations: under rETH, bounded-arity queries admit an FPTRAS iff treewidth is bounded; unbounded-arity (no negations) admit an FPTRAS iff adaptive width is bounded. No FPRAS exists unless NP=RP even for width 1, but if neither disequalities nor negations appear there is an FPRAS for queries of bounded fractional hypertreewidth, strictly generalizing STOC'21. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1899
Venue
PODS
Year
2022
Pagerank
5.3272169e-05
Overall Rank
9,036 | 38.01%
DOI
10.1145/3517804.3526231

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{focke_pods22,
        address = {New York, NY, USA},
        series = {{PODS} '22},
        title = {{Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations}},
        url = {https://dl.acm.org/doi/10.1145/3517804.3526231},
        doi = {10.1145/3517804.3526231},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Focke, Jacob and Goldberg, Leslie Ann and Roth, Marc and Živný, Stanislav},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers