Detection of Planted Solutions for Flat Satisfiability Problems.
Quentin BerthetJordan S. EllenbergPublished in: AISTATS (2019)
Keyphrases
- satisfiability problem
- stochastic local search algorithms
- np complete
- search procedures
- temporal logic
- search algorithm
- solving hard
- phase transition
- graph coloring problems
- optimal solution
- sat problem
- stochastic local search
- pspace complete
- conjunctive normal form
- evolutionary algorithm
- genetic algorithm
- search problems
- combinatorial problems
- finite domain
- inference rules