Sparsification of SAT and CSP Problems via Tractable Extensions.

Victor Lagerkvist Magnus Wahlström

Published in: ACM Trans. Comput. Theory (2020)

Keyphrases

np complete
constraint satisfaction problems
satisfiability problem
computational problems
computational complexity
least squares
combinatorial problems
tractable classes
heuristic search
constraint propagation