Database Paper Browser

Back to papers

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity

Summary: Natural tractability criterion: #UCQ(C) is FPT iff the combined CQ(s) of C and their contracts have bounded treewidth. Closure on C needed; even for a single UCQ, meta-decision NP-hard; exponential-time algorithm optimal; WL-dimension of a UCQ NP-hard. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1943
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,919 | 24.04%
DOI
10.1145/3651614

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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