Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem

DOI10.3233/FI-2009-0032zbMath1177.68098OpenAlexW2952391939MaRDI QIDQ3632009

Dorothea Baumeister, Jörg Rothe

Publication date: 23 June 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-0032

zbMATH Keywords

computational complexitycounting problemparsimonious reductiontiling of the planerotation puzzle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem