Separation Between Deterministic and Randomized Query Complexity (Q5376437)
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: Separation Between Deterministic and Randomized Query Complexity |
scientific article; zbMATH DE number 6938312
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separation Between Deterministic and Randomized Query Complexity |
scientific article; zbMATH DE number 6938312 |
Statements
Separation Between Deterministic and Randomized Query Complexity (English)
0 references
18 September 2018
0 references
deterministic decision tree
0 references
randomized decision tree
0 references
query complexity
0 references
models of computation
0 references
