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 the normal view instead:
scientific article; zbMATH DE number 6938312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9476110339164734
0 references
0.8754808902740479
0 references
