Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems.
Jean CardinalJerri NummenpaloEmo WelzlPublished in: CoRR (2017)
Keyphrases
- hard problems
- phase transition
- hyper heuristics
- np complete problems
- timetabling problem
- search heuristics
- combinatorial problems
- random instances
- satisfiability problem
- graph coloring
- constraint satisfaction
- exact solution
- polynomial equations
- stochastic local search
- monte carlo
- np complete
- randomly generated
- computational complexity
- genetic programming
- sat instances
- artificial neural networks
- sat problem
- constraint programming
- search procedures
- solution quality
- benchmark problems
- ant colony optimization
- metaheuristic
- particle swarm optimization
- dynamic programming
- sat encodings
- sat solving
- evolutionary algorithm
- davis putnam logemann loveland