Yin-Yang Puzzles are NP-complete.
Erik D. DemaineJayson LynchMikhail RudoyYushi UnoPublished in: CCCG (2021)
Keyphrases
- np complete
- constraint satisfaction problems
- constraint satisfaction
- np hard
- randomly generated
- satisfiability problem
- computational complexity
- pspace complete
- conjunctive queries
- polynomial time complexity
- np complete problems
- databases
- bounded treewidth
- data complexity
- phase transition
- polynomially solvable
- multi agent
- data mining
- fixed parameter tractable
- database