The dynamic complexity of transitive closure is in DynTC0

Theoretical Computer Science

Volumn 296, Issue 3, 2003, Pages 473-485

  Hesse, William ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; QUERY LANGUAGES;

TRANSITIVE CLOSURES;

RELATIONAL DATABASE SYSTEMS;

EID: 0037436757     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00740-5     Document Type: Conference Paper

References (13)

1. E. Allender, D.A.M. Barrington, W. Hesse, Uniform circuits for division: consequences and problems, in: Proc. 16th Ann. IEEE Conf. on Computational Complexity, 2001, pp. 150-159.
2. 1 J. Comput. System Sci. 41:1990;274-306.
3. 1 Theoret. Inform. and Appl. 35:2001;259-275.
4. Davida G.I., Litow B. Fast parallel arithmetic via modular representation. SIAM J. Comput. 20(4):1991;756-765.
5. G. Dong, L. Libkin, L. Wong, On impossibility of decremental recomputation of recursive queries in relational calculus and SQL, in: Internat. Workshop on Database Programming Languages, Gubbio, Italy, 1995.
6. Dong G., Su J. Incremental and decremental evaluation of transitive closure by first-order queries. Inform. and Comput. 120(1):1995;101-106.
7. K. Etessami, Dynamic tree isomorphism via first-order updates to a relational database, in: Proc. 17th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS '98), Association for Computing Machinery, New York, June 1998, pp. 235-243.
8. 0, in: Proc. 28th Internat. Colloq. on Automata, Languages and Programming, Crete, July 8-12, 2001, Springer, Berlin, pp. 104-114.
9. J. Holm, K. de Lichtenberg, M. Thorup, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity, in: Proc. 30th Ann. ACM Symp. on Theory of Computing (STOC-98), New York, May 23-26, 1998, ACM Press, New York, pp. 79-89.
10. Immerman N. Descriptive Complexity. 1999;Springer, New York.
11. Libkin L., Wong L. Incremental recomputation of recursive queries with nested sets and aggregate functions. Proc. Database Programming Languages (DBPL'97), Estes Park, CO, Lecture Notes in Computer Science. Vol. 1369:1998;222-238 Springer, Berlin.
12. Patnaik S., Immerman N. Dyn-FO. A parallel, dynamic complexity class J. Comput. System Sci. 55(2):1997;199-209.
13. Reif J.H., Tate S.R. On threshold circuits and polynomial computation. SIAM J. Comput. 21(5):1992;896-908.