Improved bounds for the randomized decision tree complexity of recursive majority (Q2811168)
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: Improved bounds for the randomized decision tree complexity of recursive majority |
scientific article; zbMATH DE number 6591528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved bounds for the randomized decision tree complexity of recursive majority |
scientific article; zbMATH DE number 6591528 |
Statements
10 June 2016
0 references
randomized decision tree
0 references
recursive majority
0 references
Improved bounds for the randomized decision tree complexity of recursive majority (English)
0 references
0.9947842955589294
0 references
0.940978229045868
0 references
0.7647260427474976
0 references
0.7640433311462402
0 references
0.7565004229545593
0 references
