Skip to main content
SpringerLink
Log in

Dynamic Complexity Theory Revisited

  • Conference paper
STACS 2005 (STACS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3404))

Included in the following conference series:

Abstract

Dynamic complexity asks for the effort needed to maintain the information about properties of a structure under operations changing the structure. This paper 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 can be maintained with first-order updates.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dong, G., Libkin, L., Wong, L.: Incremental recomputation in local languages. Information and Computation 181(2), 88–98 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dong, G., Su, J.: First-order incremental evaluation of datalog queries. In: Proc. of DBPL-4, Workshops in Computing, pp. 295–308. Springer, Heidelberg (1993)

    Google Scholar 

  3. Dong, G., Su, J.: Incremental and decremental evaluation of transitive closure by first-order queries. Information and Computation 120(1), 101–106 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dong, G., Su, J.: Deterministic FOIES are strictly weaker. Annals of Mathematics and Artificial Intelligence 19(1-2), 127–146 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dong, G., Su, J.: Arity bounds in first-order incremental evaluation and definition of polynomial time database queries. Journal of Computer and System Sciences 557(3), 289–308 (1998)

    Article  MathSciNet  Google Scholar 

  6. Etessami, K.: Dynamic tree isomorphism via first-order updates to a relational database. In: Proc. of the 17th PODS, pp. 235–243. ACM Press, New York (1998)

    Google Scholar 

  7. Fiat, A., Woeginger, G.J. (eds.): Online Algorithms. LNCS, vol. 1442. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  8. Gottlob, G., Leone, N., Scarcello, F.: Computing LOGCFL certificates. Theoretical Computer Science 270(1-2), 761–777 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  10. Hesse, W.: The dynamic complexity of transitive closure is in DynTC 0. Theoretical Computer Science 296(3), 473–485 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hesse, W., Immerman, N.: Complete problems for dynamic complexity classes. In: Proc. of the 17th LICS, p. 313. IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

  12. Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In: Proc. of the 30th STOC, pp. 79–89. ACM, New York (1998)

    Google Scholar 

  13. Immerman, N.: Languages that capture complexity classes. SIAM Journal on Computing 16(4), 760–778 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Libkin, L., Wong, L.: Incremental recomputation of recursive queries with nested sets and aggregate functions. In: Cluet, S., Hull, R. (eds.) DBPL 1997. LNCS, vol. 1369, pp. 222–238. Springer, Heidelberg (1998)

    Google Scholar 

  15. Libkin, L., Wong, L.: On the power of incremental evaluation in SQL-like languages. In: Connor, R.C.H., Mendelzon, A.O. (eds.) DBPL 1999. LNCS, vol. 1949, pp. 17–30. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Miltersen, P.B., Subramanian, S., Vitter, J.S., Tamassia, R.: Complexity models for incremental computation. Theoretical Computer Science 130(1), 203–236 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  17. Patnaik, S., Immerman, N.: Dyn-FO: A parallel, dynamic complexity class. Journal of Computer and System Sciences 55(2), 199–209 (1997)

    Article  MathSciNet  Google Scholar 

  18. Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: Proc. of the 36th STOC, pp. 184–191. ACM, New York (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Mathematik und Informatik, Philipps-Universität Marburg,  

    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

Editor information

Editors and Affiliations

  1. Universität Stuttgart, FMI, Germany

    Volker Diekert

  2. LIF, CNRS & Univ. de Provence,, Marseille

    Bruno Durand

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weber, V., Schwentick, T. (2005). Dynamic Complexity Theory Revisited. In: Diekert, V., Durand, B. (eds) STACS 2005. STACS 2005. Lecture Notes in Computer Science, vol 3404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31856-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31856-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24998-6

  • Online ISBN: 978-3-540-31856-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation