Planar Crossovers
From MaRDI portal
Publication:3904538
DOI10.1109/TC.1981.1675758zbMath0455.94045OpenAlexW2295541313MaRDI QIDQ3904538
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1981.1675758
Related Items (7)
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions ⋮ TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable ⋮ Planar acyclic computation ⋮ Computational properties of argument systems satisfying graph-theoretic constraints ⋮ The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions ⋮ On the complexity of planar Boolean circuits ⋮ Parameterized complexity of \((A,\ell)\)-path packing
This page was built for publication: Planar Crossovers
