P-uniform circuit complexity (Q3474881)

From MaRDI portal
Revision as of 12:17, 7 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
P-uniform circuit complexity
scientific article

    Statements

    P-uniform circuit complexity (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded-action devices
    0 references
    alternation and nondeterminism
    0 references
    complexity hierarchies
    0 references
    reducibility and completeness
    0 references
    alternating Turing machine
    0 references
    auxiliary pushdown automata
    0 references
    exponential time
    0 references
    precomposition
    0 references
    sparse sets
    0 references
    tally sets
    0 references
    parallelism
    0 references