6 citations · 20 across the 15 of their papers we have counts for
1 paper · 2 filters
Dmitriy Zhuk
Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved that…