{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:55:06Z","timestamp":1733982906796,"version":"3.30.2"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3791,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00740-5","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T17:20:43Z","timestamp":1046798443000},"page":"473-485","source":"Crossref","is-referenced-by-count":18,"title":["The dynamic complexity of transitive closure is in DynTC0"],"prefix":"10.1016","volume":"296","author":[{"given":"William","family":"Hesse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00740-5_BIB1","doi-asserted-by":"crossref","unstructured":"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\u2013159.","DOI":"10.1109\/CCC.2001.933882"},{"key":"10.1016\/S0304-3975(02)00740-5_BIB2","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00740-5_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita:2001119","article-title":"Division in logspace-uniform nc1","volume":"35","author":"Chiu","year":"2001","journal-title":"Theoret. Inform. and Appl."},{"issue":"4","key":"10.1016\/S0304-3975(02)00740-5_BIB4","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/0220048","article-title":"Fast parallel arithmetic via modular representation","volume":"20","author":"Davida","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00740-5_BIB5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.14236\/ewic\/DBPL1995.10"},{"issue":"1","key":"10.1016\/S0304-3975(02)00740-5_BIB6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/inco.1995.1102","article-title":"Incremental and decremental evaluation of transitive closure by first-order queries","volume":"120","author":"Dong","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(02)00740-5_BIB7","doi-asserted-by":"crossref","unstructured":"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 \u201998), Association for Computing Machinery, New York, June 1998, pp. 235\u2013243.","DOI":"10.1145\/275487.275514"},{"key":"10.1016\/S0304-3975(02)00740-5_BIB8","doi-asserted-by":"crossref","unstructured":"W. Hesse, Division is in uniform TC0, in: Proc. 28th Internat. Colloq. on Automata, Languages and Programming, Crete, July 8\u201312, 2001, Springer, Berlin, pp. 104\u2013114.","DOI":"10.1007\/3-540-48224-5_9"},{"key":"10.1016\/S0304-3975(02)00740-5_BIB9","doi-asserted-by":"crossref","unstructured":"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\u201326, 1998, ACM Press, New York, pp. 79\u201389.","DOI":"10.1145\/276698.276715"},{"year":"1999","series-title":"Descriptive Complexity","author":"Immerman","key":"10.1016\/S0304-3975(02)00740-5_BIB10"},{"key":"10.1016\/S0304-3975(02)00740-5_BIB11","first-page":"222","article-title":"Incremental recomputation of recursive queries with nested sets and aggregate functions","volume":"Vol. 1369","author":"Libkin","year":"1998"},{"issue":"2","key":"10.1016\/S0304-3975(02)00740-5_BIB12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1006\/jcss.1997.1520","article-title":"Dyn-FO","volume":"55","author":"Patnaik","year":"1997","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"10.1016\/S0304-3975(02)00740-5_BIB13","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1137\/0221053","article-title":"On threshold circuits and polynomial computation","volume":"21","author":"Reif","year":"1992","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:28:23Z","timestamp":1733956103000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502007405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502007405"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00740-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}