Reachability is in DynFO
From MaRDI portal
Recommendations
Cites work
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- Dyn-FO: A parallel, dynamic complexity class
- Dynamic complexity of directed reachability and other problems
- Dynamic matrix rank
- Faster dynamic matchings and vertex connectivity
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- Incremental and decremental evaluation of transitive closure by first- order queries
- Isolation, matching, and counting uniform and nonuniform upper bounds
- Matching is as easy as matrix inversion
- On Dynamic Algorithms for Algebraic Problems
- On the quantifier-free dynamic complexity of reachability
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
Cited in
(10)- Dyn-FO: A parallel, dynamic complexity class
- Maintenance of datalog materialisations revisited
- On the quantifier-free dynamic complexity of reachability
- Dynamic complexity of the Dyck reachability
- On the expressive power of query languages for matrices
- Reachability is in DynFO
- Reachability and distances under multiple changes
- Dynamic complexity of directed reachability and other problems
- Derandomizing isolation in space-bounded settings
- A strategy for dynamic programs: start over and muddle through
This page was built for publication: Reachability is in DynFO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449473)