Abstract
In the decade after its introduction in the early 1990s, dynamic descriptive complexity has seen many results; including results for the maintainability of specific queries as well as lower bounds for restricted dynamic programs. Yet, after Hesse’s proof that reachability can be maintained in \(\textsc {DynTC} ^0\) [Hes03b], work in the area stopped almost completely. Probably the focus of the community shifted to other fields because further progress on maintaining reachability was not foreseeable and proving lower bounds for other dynamic complexity classes seemed unattainable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Germany
About this chapter
Cite this chapter
Zeume, T. (2017). Conclusion. In: Small Dynamic Complexity Classes. Lecture Notes in Computer Science(), vol 10110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54314-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-54314-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-54313-9
Online ISBN: 978-3-662-54314-6
eBook Packages: Computer ScienceComputer Science (R0)