The complexity of two colouring games (Q2696280)
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 7673395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of two colouring games |
scientific article; zbMATH DE number 7673395 |
Statements
The complexity of two colouring games (English)
0 references
11 April 2023
0 references
orthogonal colouring game
0 references
orthogonal graph colouring
0 references
combinatorial game
0 references
scoring game
0 references
strictly matched involution
0 references
PSPACE-complete
0 references
NP-complete
0 references
0.8948346376419067
0 references
0.8437008261680603
0 references
0.8098215460777283
0 references
0.7954133152961731
0 references
