A subexponential lower bound for the random facet algorithm for parity games (Q5365038)
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 6783390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subexponential lower bound for the random facet algorithm for parity games |
scientific article; zbMATH DE number 6783390 |
Statements
29 September 2017
0 references
0.89374178647995
0 references
0.8877078890800476
0 references
0.8287578821182251
0 references
0.8158923387527466
0 references
