Undecidability of domino games and hhp-bisimilarity
Information and Computation
Tantrix TM rotation puzzles are intractable
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Language and Automata Theory and Applications
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Information and Computation
Satisfiability parsimoniously reduces to the Tantrix™ rotation puzzle problem
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Hi-index | 0.00 |