Login / Signup
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
Dorothea Baumeister
Jörg Rothe
Published in:
CoRR (2007)
Keyphrases
</>
satisfiability problem
np complete
phase transition
satisfiability testing
computational complexity
propositional logic
rotation invariant
real time
information systems
computational properties
learning algorithm
np hard
knowledge representation
invariant features