Login / Signup
On the relations between SAT and CSP enumerative algorithms.
Richard Génisson
Philippe Jégou
Published in:
Discret. Appl. Math. (2000)
Keyphrases
</>
data structure
computational cost
computational complexity
significant improvement
worst case
computationally efficient
constraint satisfaction problems
orders of magnitude
space complexity
stochastic local search algorithms
backtracking search
tree decompositions