The following pages link to Domino Games and Complexity (Q3495644):
Displaying 9 items.
- Simple sentences that are hard to decide (Q810009) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- On the solvability of domino snake problems (Q1331945) (← links)
- Common knowledge and update in finite environments (Q1383157) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable (Q1765243) (← links)
- Complexity analysis of propositional concurrent programs using domino tiling (Q3142002) (← links)
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (Q3540099) (← links)
