8 citations · 12 across the 5 of their papers we have counts for
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013
On Constraint Satisfaction Problems below P
Laszlo Egri
Symmetric Datalog, a fragment of the logic programming language Datalog, is conjectured to capture all constraint satisfaction problems (CSP) in L. Therefore developing tools that…
cs.CC2013★ 3 cited
Space complexity of list H-colouring: a dichotomy
Laszlo Egri, Pavol Hell, Benoit Larose +1
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative prob…