On Approximability of Satisfiable k-CSPs: IV.
Amey BhangaleSubhash KhotDor MinzerPublished in: STOC (2024)
Keyphrases
- decision problems
- sat problem
- constraint satisfaction problems
- approximation algorithms
- np hard
- max sat
- sat instances
- propositional satisfiability
- constraint satisfaction
- phase transition
- np complete
- satisfiability problem
- random sat
- random instances
- randomly generated
- search space
- sat solvers
- constraint propagation
- constraint problems
- search strategies
- backtracking algorithm
- hypertree decomposition
- orders of magnitude
- solving constraint satisfaction problems