scientific article; zbMATH DE number 7376047

DOI10.4230/LIPIcs.ICALP.2018.120zbMath1499.68136arXiv1804.08555MaRDI QIDQ5002805

Anish Mukherjee, Thomas Zeume, Samir Datta, Nils Vortmeier

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1804.08555

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distancesreachabilitydynamic complexitycomplex changes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (2)

Unnamed Item ⋮ Dynamic complexity of expansion

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining transitive closure in first order after node-set and edge-set deletions
• Dyn-FO: A parallel, dynamic complexity class
• The dynamic complexity of transitive closure is in DynTC\(^{0}\).
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• Nonrecursive incremental evaluation of Datalog queries
• On uniformity within \(NC^ 1\)
• Dynamic Complexity under Definable Changes
• Reachability is in DynFO
• On Deriving the Inverse of a Sum of Matrices
• Determinant: Old Algorithms, New Insights
• A Strategy for Dynamic Programs: Start over and Muddle through

This page was built for publication: