19 citations · 25 across the 3 of their papers we have counts for
1 paper · 1 filter
Iyad Kanj, Stefan Szeider
A CSP with n variables ranging over a domain of d values can be solved by brute-force in d^n steps (omitting a polynomial factor). With a more careful approach, this trivial upper…