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 this page instead for the normal view: A Composition Theorem for Randomized Query Complexity |
scientific article; zbMATH DE number 7278082
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
