Rikudo is NP-complete (Q2118858)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Rikudo is NP-complete	scientific article

Statements

scholarly article

0 references

Rikudo is NP-complete (English)

0 references

10.1016/j.tcs.2022.01.034

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

23 March 2022

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

NP-complete

0 references

one-player number-placement game

0 references

Rikudo

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2022.01.034

0 references

0 references

0 references

Planar 3DM is NP-complete

0 references

Efficient Planarity Testing

0 references

0 references

Minesweeper is NP-complete.

0 references

The Computational Complexity of the Game of Set and Its Theoretical Applications

0 references

GO Is Polynomial-Space Hard

0 references

\(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)

0 references

Hamiltonian cycles in T-graphs

0 references

Gobang is PSPACE-complete

0 references

Hex ist Pspace-vollständig. (Hex is Pspace-complete)

0 references

Minesweeper may not be NP-complete but is hard nonetheless

0 references

On Embedding a Graph in the Grid with the Minimum Number of Bends

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2118858

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2118858&oldid=36782118"