A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589)

From MaRDI portal
Revision as of 01:53, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
scientific article

    Statements

    A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (English)
    0 references
    0 references
    23 March 2009
    0 references
    computational complexity
    0 references
    read-once branching programs
    0 references
    nondeterminism
    0 references
    lower bounds
    0 references
    depth-restricted circuits
    0 references

    Identifiers