The following pages link to Planar Crossovers (Q3904538):
Displaying 9 items.
- Planar acyclic computation (Q751805) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable (Q1765243) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (Q3540099) (← links)
- PLANAR LACES (Q4414941) (← links)
- (Q4503947) (← links)