Dynamic complexity theory revisited

Theory of Computing Systems

Volumn 40, Issue 4, 2007, Pages 355-377

  Weber, Volker ^a   Schwentick, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC COMPLEXITY; DYNAMIC PROBLEM; FIRST-ORDER; INITIAL STRUCTURES; STRUCTURAL COMPLEXITY;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 34547178321     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1312-0     Document Type: Conference Paper

References (26)

1. David A. Mix Barrington, Neil Immerman, and Howard Straubing. On uniformity within nc. Journal of Computer and System Sciences, 41(3):274-306, 1990.
2. Allan Borodin, Alexander A. Razborov, and Roman Smolensky. On lower bounds for read-k-times branching programs. Computational Complexity, 3:1-18, 1993.
3. Stephen A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM, 18(1):4-18, 1971.
4. Guozhu Dong, Leonid Libkin, and Limsoon Wong. Incremental recomputation in local languages. Information and Computation, 181(2):88-98, 2003.
5. Guozhu Dong and Jianwen Su. First-order incremental evaluation of datalog queries. In Proc. of DBPL-4, Workshops in Computing, pages 295-308. Springer, Berlin, 1993.
6. Guozhu Dong and Jianwen Su. Incremental and decremental evaluation of transitive closure by first-order queries. Information and Computation, 120(1):101-106, 1995.
7. Guozhu Dong and Jianwen Su. Deterministic FOIES are strictly weaker. Annals of Mathematics and Artificial Intelligence, 19(1-2):127-146, 1997.
8. Guozhu Dong and Jianwen 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.
9. Kousha Etessami. Dynamic tree isomorphism, via first-order updates to a relational database. In Proc. of the. 17th PODS, pages 235-243. ACM Press, New York, 1998.
10. Amos Fiat and Gerhard J. Woeginger, editors. Online Algorithms, The State of the Art, volume 1442 of LNCS. Springer, Berlin, 1998.
11. Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford, 1995.
12. Georg Gottlob, Nicola Leone, and Francesco Scarcello. Computing LOGCFL certificates. Theoretical Computer Science, 270(1-2):761-777, 2002.
13. 0. Theoretical Computer-Science, 296(3):473-485, 2003.
14. Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proc. of the 30th ACM STOC, pages 79-89, 1998.
15. William. Hesse and Neil Immerman. Complete problems for dynamic complexity classes. In Proc. of the 17th LICS, pages 313-322. IEEE Computer Society Press, Los Alamitos, CA, 2002.
16. Neil Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760-778, 1987.
17. Neil Immerman. Descriptive Complexity. Graduate Texts in Computer Science. Springer, New York, 1999.
18. Leonid Libkin. Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, New York, 2004.
19. Leonid Libkin and Limsoon 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, Berlin, 1998.
20. Leonid Libkin and Limsoon Wong. On the power of incremental evaluation in SQL-like languages. In Proc. of DBPL-7, volume 1949 of LNCS, pages 17-30. Springer, Berlin, 2000.
21. Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, and Roberto Tamassia. Complexity models for incremental computation. Theoretical Computer Science, 130(1):203-236, 1994.
22. Sushant Patnaik and Neil Immerman. Dyn-FO: A parallel, dynamic complexity class. Journal of Computer and System Sciences, 55(2): 199-209, 1997.
23. Omer Reingold. Undirected st-connectivity in log-space. In Proc. of the 31th ACM STOC, pages 376-385, 2005.
24. Liam Roditty and Uri Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In Proc. of the 36th ACM STOC, pages 184-191, 2004.
25. Ivan Hal Sudborough. On the tape complexity of deterministic context-free languages. Journal of the ACM, 25(3):405-414, 1978.
26. Heribert Vollmer. Introduction to Circuit Complexity - A Uniform Approach. Texts in Theoretical Computer Science. An EATCS Series. Springer, New York, 1999.