On the complexity of branching programs and decision trees for clique functions (Q3798243)

From MaRDI portal
Revision as of 12:44, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the complexity of branching programs and decision trees for clique functions
scientific article

    Statements

    On the complexity of branching programs and decision trees for clique functions (English)
    0 references
    0 references
    1988
    0 references
    complexity hierarchies
    0 references
    clique functions
    0 references
    Boolean decision-tree
    0 references
    branching programs
    0 references
    polynomial lower bounds
    0 references
    sequences of Boolean functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references