Reachability is in DynFO (Q3449473): Difference between revisions

From MaRDI portal
← Older edit
Import240304020342 (talk | contribs)
4,416,906 edits
Set profile property.
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎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.1007/978-3-662-47666-6_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1930553816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation, matching, and counting uniform and nonuniform upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Complexity of Directed Reachability and Other Problems / 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: Arity bounds in first-order incremental evaluation and definition of polynomial time database queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic matrix rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic complexity of transitive closure is in DynTC\(^{0}\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / 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: On Dynamic Algorithms for Algebraic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quantifier-free dynamic complexity of reachability / rank
 
Normal rank

Latest revision as of 00:11, 11 July 2024

scientific article
Language Label Description Also known as
English
Reachability is in DynFO
scientific article

    Statements

    title
    Reachability is in DynFO (English)
    0 references
    author
    Samir Datta
    0 references
    Raghav Kulkarni
    0 references
    Anish Mukherjee
    0 references
    Thomas Schwentick
    0 references
    Thomas Zeume
    0 references
    publication date
    4 November 2015
    0 references

    Identifiers

    zbMATH DE Number
    6504588
    0 references
    OpenAlex ID
    W1930553816
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3449473&oldid=36210914"
    Powered by MediaWiki