Dynamic complexity of reachability: how many changes can we handle?
From MaRDI portal
Cites work
- A strategy for dynamic programs: start over and muddle through
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- Boolean function complexity. Advances and frontiers.
- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
- Dyn-FO: A parallel, dynamic complexity class
- Dynamic complexity of directed reachability and other problems
- Green's theorem and isolation in planar graphs
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- Logspace versions of the theorems of Bodlaender and Courcelle
- Near-optimal small-depth lower bounds for small distance connectivity
- Nondeterministic Space is Closed under Complementation
- On Deriving the Inverse of a Sum of Matrices
- On uniformity within \(NC^ 1\)
- Reachability and distances under multiple changes
- Reachability is in DynFO
- Space complexity of perfect matching in bounded genus bipartite graphs
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- The method of forced enumeration for nondeterministic automata
- Trading determinism for time in space bounded computations
- Uniform constant-depth threshold circuits for division and iterated multiplication.
This page was built for publication: Dynamic complexity of reachability: how many changes can we handle?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842448)
