P-uniform circuit complexity (Q3474881): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/76359.76370 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095274905 / rank
 
Normal rank

Latest revision as of 22:42, 19 March 2024

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
    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
    0 references
    0 references