On the complexity of the decisive problem in simple and weighted games (Q2840677)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of the decisive problem in simple and weighted games |
scientific article; zbMATH DE number 6190213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the decisive problem in simple and weighted games |
scientific article; zbMATH DE number 6190213 |
Statements
23 July 2013
0 references
simple/weighted game
0 references
hypergraph
0 references
self-duality
0 references
quasi-polynomial
0 references
On the complexity of the decisive problem in simple and weighted games (English)
0 references
0.8770473003387451
0 references
0.8281431198120117
0 references
0.8243813514709473
0 references
0.8178452253341675
0 references
0.8140502572059631
0 references
