Space Complexity of Reachability Testing in Labelled Graphs (Q5739010): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reachability Problems: An Update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite monoids and the fine structure of <i>NC</i> <sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite loops recognize exactly the regular open languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Monoids: From Word to Circuit Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to Barrington's M-program model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Planar Reachability Is in Unambiguous Log-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded fan-in circuits and associative functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a group-labelled graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a path with two labels forbidden in group-labeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of L-reachability* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally trivial categories and unambiguous concatenation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom walks on regular digraphs and the RL vs. L problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sequential nature of interprocedural program-analysis problems / rank
 
Normal rank

Latest revision as of 21:31, 13 July 2024

scientific article; zbMATH DE number 6725149
Language Label Description Also known as
English
Space Complexity of Reachability Testing in Labelled Graphs
scientific article; zbMATH DE number 6725149

    Statements

    Identifiers

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