The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions.

Dorothea Baumeister Jörg Rothe

Published in: LATA (2008)

Keyphrases

np complete
color images
color information
color space
satisfiability problem
color segmentation
np hard
randomly generated
color correction
computational problems
objective function
rotation invariant
color constancy
np complete problems