Query maintenance under batch changes with small-depth circuits
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 7471669 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- Boolean function complexity. Advances and frontiers.
- Dyn-FO: A parallel, dynamic complexity class
- Dynamic complexity of reachability: how many changes can we handle?
- Dynamic complexity of regular languages: big changes, small work
- Dynamic graph queries
- Incremental and decremental evaluation of transitive closure by first- order queries
- Logspace versions of the theorems of Bodlaender and Courcelle
- Minimizing Disjunctive Normal Form Formulas and AC^0 Circuits Given a Truth Table
- On the complexity of some problems on groups input as multiplication tables
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs
- Reachability and distances under multiple changes
- Reachability is in DynFO
- The dynamic complexity of formal languages
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Uniform constant-depth threshold circuits for division and iterated multiplication.
This page was built for publication: Query maintenance under batch changes with small-depth circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241048)
