Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems.
Jean CardinalJerri NummenpaloEmo WelzlPublished in: IPEC (2017)
Keyphrases
- hard problems
- phase transition
- hyper heuristics
- np complete problems
- timetabling problem
- search heuristics
- graph coloring
- random instances
- genetic programming
- combinatorial problems
- satisfiability problem
- np complete
- optimal solution
- constraint satisfaction
- stochastic local search
- polynomial equations
- evolutionary algorithm
- difficult problems
- combinatorial optimization
- sat problem
- artificial neural networks
- sat encodings
- exact solution
- constraint programming
- sat instances
- propositional logic
- metaheuristic
- feasible solution
- genetic algorithm
- sat solving