Dynamic complexity theory revisited

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 256-268

  Weber, Volker ^a   Schwentick, Thomas ^a  

^a PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; INFORMATION THEORY; PROBLEM SOLVING;

DYNAMIC COMPLEXITY; LOGCFL; STRUCTURAL COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 24144473406     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_21     Document Type: Conference Paper

References (18)

1. G. Dong, L. Libkin, and L. Wong. Incremental recomputation in local languages. Information and Computation, 181(2):88-98, 2003.
2. G. Dong and J. Su. First-order incremental evaluation of datalog queries. In Proc. of DBPL-4, Workshops in Computing, pages 295-308. Springer, 1993.
3. G. Dong and J. Su. Incremental and decremental evaluation of transitive closure by first-order queries. Information and Computation, 120(1):101-106, 1995.
4. G. Dong and J. Su. Deterministic FOIES are strictly weaker. Annals of Mathematics and Artificial Intelligence, 19(1-2):127-146, 1997.
5. G. Dong and J. Su. 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.
6. K. Etessami. Dynamic tree isomorphism via first-order updates to a relational database. In Proc. of the 17th PODS, pages 235-243. ACM Press, 1998.
7. A. Fiat and G. J. Woeginger, editors. Online Algorithms, The State of the Art, volume 1442 of LNCS. Springer, 1998.
8. G. Gottlob, N. Leone, and F. Scarcello. Computing LOGCFL certificates. Theoretical Computer Science, 270(1-2):761-777, 2002.
9. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.
10. W. Hesse. The dynamic complexity of transitive closure is in DynTC°. Theoretical Computer Science, 296(3):473-485, 2003.
11. W. Hesse and N. Immerman. Complete problems for dynamic complexity classes. In Proc. of the 17th LICS, pages 313-. IEEE Computer Society, 2002.
12. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proc. of the 30th STOC, pages 79-89. ACM, 1998.
13. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16 (4):760-778, 1987.
14. L. Libkin and L. Wong. Incremental recomputation of recursive queries with nested sets and aggregate functions. In Proc. of DBPL-6, volume 1369 of LNCS, pages 222-238. Springer, 1998.
15. L. Libkin and L. Wong. On the power of incremental evaluation in SQL-like languages. In Proc. of DBPL-7, volume 1949 of LNCS, pages 17-30. Springer, 2000.
16. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia. Complexity models for incremental computation. Theoretical Computer Science, 130(1):203-236, 1994.
17. S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. Journal of Computer and System Sciences, 55(2):199-209, 1997.
18. L. Roditty and U. Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In Proc. of the 36th STOC, pages 184-191. ACM, 2004.