Randomized query complexity of sabotaged and composed functions (Q4598199)
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: Randomized query complexity of sabotaged and composed functions |
scientific article; zbMATH DE number 6820249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized query complexity of sabotaged and composed functions |
scientific article; zbMATH DE number 6820249 |
Statements
19 December 2017
0 references
randomized query complexity
0 references
decision-tree complexity
0 references
composition theorem
0 references
partition bound
0 references
lifting theorem
0 references
0.841292142868042
0 references
0.7830398082733154
0 references
