Tetravex is NP-complete (Q845713): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/ipl/TakenagaW06, #quickstatements; #temporary_batch_1731530891435 |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ipl/TakenagaW06 / rank | |||
Normal rank | |||
Latest revision as of 21:55, 13 November 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
