On Approximability of Satisfiable k-CSPs: IV.
Amey BhangaleSubhash KhotDor MinzerPublished in: Electron. Colloquium Comput. Complex. (2023)
Keyphrases
- sat problem
- constraint satisfaction problems
- phase transition
- constraint satisfaction
- satisfiability problem
- randomly generated
- np complete
- constraint propagation
- random instances
- approximation algorithms
- solving constraint satisfaction problems
- arc consistency
- sat instances
- constraint problems
- constraint programming
- symmetry breaking
- max sat
- search space
- sat solvers
- constraint networks
- non binary
- decision problems
- tree decomposition
- cnf formula
- neural network
- np hard
- backtracking algorithm
- partial constraint satisfaction
- soft constraints
- optimal solution
- genetic algorithm