Work-sensitive dynamic complexity of formal languages (Q2233429): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jonas Schmidt / rank
Normal rank
 
Property / author
 
Property / author: Jonas Schmidt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3142840804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic nested brackets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract state machines: a unifying view of models of computation and of system design frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Is in DynFO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for the Dyck languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic word problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic complexity of formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully-dynamic planarity testing in polylogarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Descriptive Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity models for incremental computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyn-FO: A parallel, dynamic complexity class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Work-sensitive dynamic complexity of formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Complexity under Definable Changes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank

Latest revision as of 20:50, 26 July 2024

scientific article
Language Label Description Also known as
English
Work-sensitive dynamic complexity of formal languages
scientific article

    Statements

    Work-sensitive dynamic complexity of formal languages (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2021
    0 references
    0 references
    dynamic complexity
    0 references
    work
    0 references
    parallel constant time
    0 references
    0 references