Dynamic Complexity Theory Revisited

Authors:
Volker Weber;Thomas Schwentick
Affiliations:
Fachbereich Informatik, Universitat Dortmund, D-44227 Dortmund, Germany;Fachbereich Informatik, Universitat Dortmund, D-44227 Dortmund, Germany
Venue:
Theory of Computing Systems
Year:
2007

Citing 0
Cited 2

The dynamic complexity of formal languages

ACM Transactions on Computational Logic (TOCL)
Connectivity games over dynamic networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of dynamic problems which takes the initial structure into account. It develops the basic structural complexity notions accordingly. It also shows that the dynamic version of the LOGCFL-complete problem D2LREACH(acyclic) can be maintained with first-order updates.