Rikudo is NP-complete
From MaRDI portal
Publication:2118858
DOI10.1016/J.TCS.2022.01.034OpenAlexW4210480498MaRDI QIDQ2118858FDOQ2118858
Authors: Viet-Ha Nguyen, Kévin Perrot 
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.034
Recommendations
- Shikaku and Ripple Effect are NP-complete
- Hashiwokakero is NP-complete
- HIROIMONO Is NP-Complete
- scientific article; zbMATH DE number 1342225
- Tatamibari is NP-complete
- Knuth--bendix constraint solving is NP-complete
- scientific article; zbMATH DE number 1754649
- On strong NP-completeness of rational problems
- Computational complexity of NURIKABE
- The STO problem is NP-complete
Cites Work
- Planar 3DM is NP-complete
- Efficient Planarity Testing
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- GO Is Polynomial-Space Hard
- Hamiltonian cycles in T-graphs
- Title not available (Why is that?)
- Minesweeper is NP-complete.
- The computational complexity of the game of Set and its theoretical applications
- Minesweeper may not be NP-complete but is hard nonetheless
- Gobang is PSPACE-complete
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Rikudo is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118858)
