Separation Between Deterministic and Randomized Query Complexity (Q5376437): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129351436, #quickstatements; #temporary_batch_1730407207240 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129351436 / rank | |||
Normal rank | |||
Latest revision as of 21:41, 31 October 2024
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
