6 citations · 20 across the 15 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020★ 5 cited
Strong subalgebras and the Constraint Satisfaction Problem
Dmitriy Zhuk
In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP) over a constraint language is tractable if and only if is preserved by a weak near-unanimity (WNU)…
cs.CC2020
No-Rainbow Problem and the Surjective Constraint Satisfaction Problem
Dmitriy Zhuk
The Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constr…