Abstract
Holzer and Holzer [HH04] proved that the TantrixTM 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 TantrixTM rotation puzzle problem. In particular, this reduction preserves the uniqueness of the solution, which implies that the unique TantrixTM 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.
Supported in part by DFG grant RO 1202/9-3 and the Alexander von Humboldt Foundation’s TransCoop program. URL: http://ccc.cs.uni-duesseldorf.de/ rothe
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barbanchon, R.: On unique graph 3-colorability and parsimonious reductions in the plane. Theoretical Computer Science 319(1–3), 455–482 (2004)
Baumeister, D., Rothe, J.: Satisfiability parsimoniously reduces to the TantrixTM rotation puzzle problem. Technical Report cs.CC/0705.0915, ACM Computing Research Repository (CoRR) (May 2007)
Cai, J., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagner, K., Wechsung, G.: The boolean hierarchy I: Structural properties. SIAM Journal on Computing 17(6), 1232–1252 (1988)
Cai, J., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagner, K., Wechsung, G.: The boolean hierarchy II: Applications. SIAM Journal on Computing 18(1), 95–111 (1989)
Chang, R., Kadin, J., Rohatgi, P.: On unique satisfiability and the threshold behavior of randomized reductions. Journal of Computer and System Sciences 50(3), 359–373 (1995)
Cook, S.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, pp. 151–158. ACM Press, New York (1971)
Grädel, E.: Domino games and complexity. SIAM Journal on Computing 19(5), 787–804 (1990)
Holzer, M., Holzer, W.: TantrixTM rotation puzzles are intractable. Discrete Applied Mathematics 144(3), 345–358 (2004)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Papadimitriou, C., Yannakakis, M.: The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences 28(2), 244–259 (1984)
Rothe, J.: Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science. Springer, Heidelberg (2005)
Riege, T., Rothe, J.: Completeness in the boolean hierarchy: Exact-Four-Colorability, minimal graph uncolorability, and exact domatic number problems – a survey. Journal of Universal Computer Science 12(5), 551–578 (2006)
Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science 8(2), 189–201 (1979)
Valiant, L., Vazirani, V.: NP is as easy as detecting unique solutions. Theoretical Computer Science 47, 85–93 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baumeister, D., Rothe, J. (2007). Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. In: Durand-Lose, J., Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2007. Lecture Notes in Computer Science, vol 4664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74593-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-74593-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74592-1
Online ISBN: 978-3-540-74593-8
eBook Packages: Computer ScienceComputer Science (R0)