rotation puzzle problems are NP-complete via parsimonious reductions.

Dorothea Baumeister Jörg Rothe

Published in: Inf. Comput. (2009)

Keyphrases

np complete
computational complexity
bounded treewidth
polynomial time complexity
np hard
randomly generated
pspace complete
np complete problems
data sets
databases
learning algorithm
integrity constraints
phase transition
satisfiability problem
problems involving