Work

Query Maintenance Under Batch Changes with Small-Depth Circuits

Year: 2024

Type: conference-paper

Abstract: Which dynamic queries can be maintained efficiently? For constant-size changes, it is known that constant-depth circuits or, equivalently, first-order updates suffice for maintaining many important queries, among them reachability, tree isomorphism, and the word problem for context-free languages. In other words, these queries are in the dynamic complexity class DynFO. We show that most of the existing results for constant-size changes can be recovered for batch changes of polylogarithmic size if one allows circuits of depth O(log log n) or, equivalently, first-order updates that are iterated O(log log n) times.

Source: Zurich Open Repository and Archive (University of Zurich)

DOI: 10.4230/lipics.mfcs.2024.46

Authors: Datta, Samir, Khan, Asif, Mukherjee, Anish, Tschirbs, Felix, Vortmeier, Nils, Zeume, Thomas

Institutions: Chennai Mathematical Institute, University of Warwick, Ruhr University Bochum

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Deutsche Forschungsgemeinschaft, Infosys Foundation, Engineering and Physical Sciences Research Council

Awards: Theoretical Foundations of Modern Parallel and Distributed Algorithms, Perspektiven auf die dynamische Komplexitätstheorie