Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705)

From MaRDI portal
Revision as of 08:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Randomized vs. deterministic decision tree complexity for read-once Boolean functions
scientific article

    Statements

    Randomized vs. deterministic decision tree complexity for read-once Boolean functions (English)
    0 references
    0 references
    0 references
    10 October 1993
    0 references
    Boolean decision trees
    0 references
    randomized complexity
    0 references
    read-once formulae
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references