On the complexity of the misère version of three games played on graphs (Q2354773)
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 6464114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the misère version of three games played on graphs |
scientific article; zbMATH DE number 6464114 |
Statements
On the complexity of the misère version of three games played on graphs (English)
0 references
24 July 2015
0 references
combinatorial games
0 references
complexity
0 references
graphs
0 references
misère
0 references
0.8451127409934998
0 references
0.8247205018997192
0 references
0.8170714378356934
0 references
0.8151756525039673
0 references
0.8043252825737
0 references
