Login / Signup
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Dorothea Baumeister
Jörg Rothe
Published in:
CoRR (2007)
Keyphrases
</>
np complete
color images
color information
color space
constraint satisfaction problems
satisfiability problem
color segmentation
color components
video sequences
image regions
decision problems
rotation invariant
invariant features
color correction
polynomially solvable