On Approximability of Satisfiable k-CSPs: III.
Amey BhangaleSubhash KhotDor MinzerPublished in: STOC (2023)
Keyphrases
- sat problem
- constraint satisfaction problems
- constraint satisfaction
- phase transition
- randomly generated
- satisfiability problem
- np complete
- search space
- random instances
- approximation algorithms
- constraint propagation
- arc consistency
- constraint problems
- symmetry breaking
- max sat
- non binary
- solving constraint satisfaction problems
- constraint networks
- backtracking algorithm
- np hard
- sat instances
- tree decomposition
- hypertree decomposition
- computational complexity
- subgraph isomorphism
- decomposition method
- temporal constraints
- worst case
- neural network
- partial constraint satisfaction