Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles.
Chuzo IwamotoTatsuaki IbusukiPublished in: IEICE Trans. Inf. Syst. (2020)
Keyphrases
- sat solvers
- constraint satisfaction
- satisfiability problem
- worst case
- computational complexity
- sat solving
- special case
- sat problem
- approximation algorithms
- stochastic local search algorithms
- propositional satisfiability
- sat instances
- stochastic local search
- search algorithm
- phase transition
- orders of magnitude
- propositional logic
- efficient computation
- finite automata