Solving Satisfiability Problems Using Logic Synthesis and Reconfigurable Hardware.
Takayuki SuyamaMakoto YokooHiroshi SawadaPublished in: HICSS (7) (1998)
Keyphrases
- satisfiability problem
- logic synthesis
- stochastic local search
- reconfigurable hardware
- np complete
- temporal logic
- phase transition
- search algorithm
- multi valued
- graph coloring problems
- low cost
- sat problem
- heuristic search
- quantum computing
- fine grain
- constraint satisfaction problems
- scheduling problem
- np hard
- machine learning