Separation Between Deterministic and Randomized Query Complexity (Q5376437): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 20:01, 5 March 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references