Dynamic complexity of expansion
From MaRDI portal
Publication:2117075
Cites work
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- scientific article; zbMATH DE number 7650849 (Why is no real title available?)
- A more general theory of static approximations for conjunctive queries
- A strategy for dynamic programs: start over and muddle through
- An expansion tester for bounded degree graphs
- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
- Dyn-FO: A parallel, dynamic complexity class
- Dynamic Complexity under Definable Changes
- Dynamic complexity of directed reachability and other problems
- Dynamic complexity of the Dyck reachability
- Dynamic graph queries
- Expressibility and Parallel Complexity
- Low-depth uniform threshold circuits and the bit-complexity of straight line programs
- Near-optimal small-depth lower bounds for small distance connectivity
- Nonrecursive incremental evaluation of Datalog queries
- On testing expansion in bounded-degree graphs
- On the quantifier-free dynamic complexity of reachability
- On uniformity within \(NC^ 1\)
- Problems complete for deterministic logarithmic space
- Reachability and distances under multiple changes
- Reachability is in DynFO
- Testing Expansion in Bounded-Degree Graphs
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- The dynamic descriptive complexity of \(k\)-clique
- Uniform constant-depth threshold circuits for division and iterated multiplication.
Cited in
(3)
This page was built for publication: Dynamic complexity of expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117075)
