Solving Satisfiability Problem on Quantum Annealer: A Lesson from FPGA CAD Tools: (Abstract Only).
Juexiao SuLei HePublished in: FPGA (2018)
Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- sat instances
- np complete
- search algorithm
- phase transition
- temporal logic
- weighted max sat
- finite domain
- sat problem
- systematic search algorithms
- davis putnam logemann loveland
- stochastic local search algorithms
- max sat
- decision procedures
- hardware implementation
- graph coloring problems
- pspace complete
- data exchange
- integrity constraints
- learning objects
- np hard