6 citations · 20 across the 15 of their papers we have counts for
1 paper · 2 filters
Dmitriy Zhuk
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on…