Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem

Authors:
Dorothea Baumeister;Jörg Rothe
Affiliations:
Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, 40225 Düsseldorf, Germany. rothe@cs.uni-duesseldorf.de;(Correspd.) Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, 40225 Düsseldorf, Germany. rothe@cs.uni-duesseldorf.de
Venue:
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Year:
2009

Citing 14
Cited 0

NP is as easy as detecting unique solutions

Theoretical Computer Science
Graph minimal uncolorability is DP-complete

SIAM Journal on Computing
The Boolean hierarchy I: structural properties

SIAM Journal on Computing
The Boolean hierarchy II: applications

SIAM Journal on Computing
Domino games and complexity

SIAM Journal on Computing
On unique satisfiability and the threshold behavior of randomized reductions

Journal of Computer and System Sciences
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Exact complexity of exact-four-colorability

Information Processing Letters
The monotone and planar circuit value problems are log space complete for P

ACM SIGACT News
On unique graph 3-colorability and parsimonious reductions in the plane

Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Tantrix TM rotation puzzles are intractable

Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Complexity Theory and Cryptology

Complexity Theory and Cryptology
Planar Crossovers

IEEE Transactions on Computers
Satisfiability parsimoniously reduces to the Tantrix™ rotation puzzle problem

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

Quantified Score

Hi-index	0.00

Visualization

Abstract

Holzer and Holzer [10] proved that the Tantrix™ rotation puzzle problem is NP-complete. They also showed that for infinite rotation puzzles, this problem becomes undecidable. We study the counting version and the unique version of this problem. We prove that the satisfiability problem parsimoniously reduces to the Tantrix™ rotation puzzle problem. In particular, this reduction preserves the uniqueness of the solution, which implies that the unique Tantrix™ rotation puzzle problem is as hard as the unique satisfiability problem, and so is DP-complete under polynomial-time randomized reductions, where DP is the second level of the boolean hierarchy over NP.