Yin-Yang Puzzles are NP-complete.
Erik D. DemaineJayson LynchMikhail RudoyYushi UnoPublished in: CoRR (2021)
Keyphrases
- np complete
- constraint satisfaction
- constraint satisfaction problems
- np hard
- randomly generated
- satisfiability problem
- computational complexity
- conjunctive queries
- polynomially solvable
- pspace complete
- polynomial time complexity
- phase transition
- crossword puzzles
- computer vision
- sat problem
- data complexity
- hidden markov models
- np complete problems
- objective function
- image processing