Tetravex is NP-complete (Q845713): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2136889863 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tetris is Hard, Even to Approximate / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: It is tough to be a plumber / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The \((n^ 2-1)\)-puzzle and related relocation problems / rank | |||
Normal rank | |||
Latest revision as of 09:53, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tetravex is NP-complete |
scientific article |
Statements
Tetravex is NP-complete (English)
0 references
29 January 2010
0 references
computational complexity
0 references
NP-completeness
0 references
tetravex
0 references
