Dynamic Complexity Theory Revisited

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 LOGCFLcomplete problem D2LREACH(acyclic) can be maintained with first-order updates.

• Type: Conference
• Year: 2005
• Where: STACS
• Authors: Volker Weber, Thomas Schwentick
• Keywords: Dynamic Complexity, Dynamic Problems, STACS 2005, Structural Complexity Notions, Theoretical Computer Science