On uniform circuit complexity (Q1152951): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(81)90038-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027501230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to models of synchronous parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling with an auxiliary pushdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the power of vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network complexity and the Turing machine complexity of finite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Bounded Random Access Machines with Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the membership problem for some extensions of context-free languagest† / rank
 
Normal rank

Latest revision as of 11:27, 13 June 2024

scientific article
Language Label Description Also known as
English
On uniform circuit complexity
scientific article

    Statements

    On uniform circuit complexity (English)
    0 references
    0 references
    1981
    0 references
    parallel complexity
    0 references
    alternating Turing machines
    0 references
    context-free language recognition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references