Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time (Q3768395): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/62.322433 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064968744 / rank | |||
Normal rank | |||
Latest revision as of 00:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time |
scientific article |
Statements
Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time (English)
0 references
1984
0 references
complexity classes
0 references
k-pebble game problem
0 references
deterministic polynomial time
0 references
polynomial-time lower bounds
0 references
