Playing disjunctive sums is polynomial space complete (Q1159098): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4099541 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Combinatorial Problem Which Is Complete in Polynomial Space / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: GO Is Polynomial-Space Hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4131648 / rank | |||
Normal rank | |||
Latest revision as of 13:30, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Playing disjunctive sums is polynomial space complete |
scientific article |
Statements
Playing disjunctive sums is polynomial space complete (English)
0 references
1981
0 references
disjunctive sum of games
0 references
Go
0 references
polynomial space complete
0 references
