Properties that characterize LOGCFL (Q1176109): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Applications of Inductive Counting for Complementation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / 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: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership for growing context-sensitive grammars is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Languages Generated by Attribute Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for first order expressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity theory based on Boolean algebra / 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
Property / cites work
 
Property / cites work: On the Tape Complexity of Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Parallel Random Access Machines by Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties that characterize LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Pebble Game that Characterizes Parallel Complexity Classes / rank
 
Normal rank

Latest revision as of 10:08, 15 May 2024

scientific article
Language Label Description Also known as
English
Properties that characterize LOGCFL
scientific article

    Statements

    Properties that characterize LOGCFL (English)
    0 references
    0 references
    25 June 1992
    0 references
    parallel complexity class
    0 references
    languages log space reducible to context-free languages
    0 references
    semi-unboundedness
    0 references
    polynomial proof-size
    0 references
    LOGCFL
    0 references
    semi- unbounded fan-in circuit families
    0 references

    Identifiers

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