1.2k citations · 1.7k across the 17 of their papers we have counts for
1 paper · 1 filter
G. Gottlob, N. Leone, F. Scarcello
Several important decision problems on conjunctive queries (CQs) are NP-complete in general but become tractable, and actually highly parallelizable, if restricted to acyclic or ne…