LaserTank is NP-Complete (Q5014691)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7441080

Language	Label	Description	Also known as
English	LaserTank is NP-Complete	scientific article; zbMATH DE number 7441080

Statements

scholarly article

0 references

LaserTank is NP-Complete (English)

0 references

Per Alexandersson

0 references

0 references

Mathematical Aspects of Computer and Information Sciences

0 references

publication date

8 December 2021

0 references

full work available at URL

https://arxiv.org/abs/1908.05966

0 references

zbMATH Keywords

NP-completeness

0 references

LaserTank

0 references

3-SAT

0 references

MaRDI profile type

MaRDI publication profile

0 references

The complexity of theorem-proving procedures

0 references

Gaming is a hard job, but someone has to do it!

0 references

Minesweeper may not be NP-complete but is hard nonetheless

0 references

Minesweeper is NP-complete.

0 references

Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants''

0 references

SOKOBAN and other motion planning problems

0 references

Tetris is Hard, Even to Approximate

0 references

Identifiers

10.1007/978-3-030-43120-4_26

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5014691

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