On the complexity of some coloring games (Q4028100)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 139777
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of some coloring games |
scientific article; zbMATH DE number 139777 |
Statements
28 March 1993
0 references
PSPACE-complete
0 references
polynomial time algorithms
0 references
0.9985087513923644
0 references
0.9128309488296508
0 references
0.8591665029525757
0 references
0.8393115997314453
0 references
0.8392078280448914
0 references
On the complexity of some coloring games (English)
0 references
