Dyn-FO: A parallel, dynamic complexity class (Q1376403): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental and decremental evaluation of transitive closure by first- order queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressibility and Parallel Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of quantifiers is better than number of tape cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of iterated multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematic derivation of incremental programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrity constraint checking in stratified databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity models for incremental computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for improving integrity checking in relational data bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic sensitivity of a chemostat for a microbial reaction with substrate and product inhibition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved data structures for fully dynamic biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a sparse table / rank
 
Normal rank

Latest revision as of 10:00, 28 May 2024

scientific article
Language Label Description Also known as
English
Dyn-FO: A parallel, dynamic complexity class
scientific article

    Statements

    Dyn-FO: A parallel, dynamic complexity class (English)
    0 references
    0 references
    0 references
    11 June 1998
    0 references
    computational complexity
    0 references

    Identifiers