Browsing by Subject "Constraint satisfaction problems"
Now showing items 1-1 of 1
-
(SIAM, 2016)It is known that unions of acyclic conjunctive queries (CQs) can be evaluated in linear time, as opposed to arbitrary CQs, for which the evaluation problem is NP-complete. It follows from techniques in the area of ...