A composition theorem for randomized query complexity (Q5136299)
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 7278082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A composition theorem for randomized query complexity |
scientific article; zbMATH DE number 7278082 |
Statements
25 November 2020
0 references
query algorithms
0 references
query complexity
0 references
decision trees
0 references
composition theorem
0 references
XOR lemma
0 references
hardness amplification
0 references
A Composition Theorem for Randomized Query Complexity (English)
0 references
0.841292142868042
0 references
0.8025709986686707
0 references
0.7898377180099487
0 references
0.7790057063102722
0 references
