P-uniform circuit complexity (Q3474881)

From MaRDI portal
Revision as of 05:17, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1058525)
scientific article
Language Label Description Also known as
English
P-uniform circuit complexity
scientific article

    Statements

    title
    P-uniform circuit complexity (English)
    0 references
    DOI
    10.1145/76359.76370
    0 references
    publication date
    1989
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    03D15
    0 references
    68Q05
    0 references
    zbMATH DE Number
    4143426
    0 references
    zbMATH Keywords
    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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3474881&oldid=22412372"
    Powered by MediaWiki