Skip to main content
SpringerLink
Log in

Dynamic Complexity Theory Revisited

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universitat Dortmund, D-44227 Dortmund, Germany

    Volker Weber & Thomas Schwentick

Authors
  1. Volker Weber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Schwentick
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Volker Weber or Thomas Schwentick.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weber, V., Schwentick, T. Dynamic Complexity Theory Revisited. Theory Comput Syst 40, 355–377 (2007). https://doi.org/10.1007/s00224-006-1312-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-006-1312-0

Keywords

Search

Navigation