{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:29:46Z","timestamp":1742995786009,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_46","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"547-558","source":"Crossref","is-referenced-by-count":1,"title":["The Dynamic Descriptive Complexity of k-Clique"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Zeume","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Dong, G., Libkin, L., Wong, L.: On impossibility of decremental recomputation of recursive queries in relational calculus and SQL. In: DBPL 1995, p. 7 (1995)","DOI":"10.14236\/ewic\/DBPL1995.10"},{"issue":"2","key":"46_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0890-5401(03)00017-8","volume":"181","author":"G. Dong","year":"2003","unstructured":"Dong, G., Libkin, L., Wong, L.: Incremental recomputation in local languages. Inf. Comput.\u00a0181(2), 88\u201398 (2003)","journal-title":"Inf. Comput."},{"issue":"1-2","key":"46_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1018951521198","volume":"19","author":"G. Dong","year":"1997","unstructured":"Dong, G., Su, J.: Deterministic FOIES are strictly weaker. Ann. Math. Artif. Intell.\u00a019(1-2), 127\u2013146 (1997)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"46_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jcss.1998.1565","volume":"57","author":"G. Dong","year":"1998","unstructured":"Dong, G., Su, J.: Arity bounds in first-order incremental evaluation and definition of polynomial time database queries. J. Comput. Syst. Sci.\u00a057(3), 289\u2013308 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1-3","key":"46_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0012-365X(93)E0139-U","volume":"137","author":"D. Duffus","year":"1995","unstructured":"Duffus, D., Lefmann, H., R\u00f6dl, V.: Shift graphs and lower bounds on Ramsey numbers r\n                           \n                    k\n                  (l; r). Discrete Mathematics\u00a0137(1-3), 177\u2013187 (1995)","journal-title":"Discrete Mathematics"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P., Rado, R.: Combinatorial theorems on classifications of subsets of a given set. Proc. London Math. Soc. 2(3), 417\u2013439 (1952)","DOI":"10.1112\/plms\/s3-2.1.417"},{"issue":"1","key":"46_CR7","first-page":"93","volume":"16","author":"P. Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P., Hajnal, A., Rado, R.: Partition relations for cardinal numbers. Acta Mathematica Hungarica\u00a016(1), 93\u2013196 (1965)","journal-title":"Acta Mathematica Hungarica"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Etessami, K.: Dynamic tree isomorphism via first-order updates. In: PODS 1998, pp. 235\u2013243 (1998)","DOI":"10.1145\/275487.275514"},{"issue":"3","key":"46_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2287718.2287719","volume":"13","author":"W. Gelade","year":"2012","unstructured":"Gelade, W., Marquardt, M., Schwentick, T.: The dynamic complexity of formal languages. ACM Trans. Comput. Log.\u00a013(3), 19 (2012)","journal-title":"ACM Trans. Comput. Log."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Siebertz, S.: Dynamic definability. In: ICDT 2012, pp. 236\u2013248 (2012)","DOI":"10.1145\/2274576.2274601"},{"key":"46_CR11","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. Wiley Series in Discrete Mathematics and Optimization. Wiley (1990)"},{"issue":"3","key":"46_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(02)00740-5","volume":"296","author":"W. Hesse","year":"2003","unstructured":"Hesse, W.: The dynamic complexity of transitive closure is in DynTC0. Theor. Comput. Sci.\u00a0296(3), 473\u2013485 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"46_CR13","unstructured":"Hesse, W.: Dynamic Computational Complexity. PhD thesis, University of Massachusetts Amherst (2003)"},{"issue":"2","key":"46_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/jcss.1997.1520","volume":"55","author":"S. Patnaik","year":"1997","unstructured":"Patnaik, S., Immerman, N.: Dyn-FO: A parallel, dynamic complexity class. J. Comput. Syst. Sci.\u00a055(2), 199\u2013209 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"46_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00224-006-1312-0","volume":"40","author":"V. Weber","year":"2007","unstructured":"Weber, V., Schwentick, T.: Dynamic complexity theory revisited. Theory Comput. Syst.\u00a040(4), 355\u2013377 (2007)","journal-title":"Theory Comput. Syst."},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/978-3-642-40313-2_73","volume-title":"Mathematical Foundations of Computer Science 2013","author":"T. Zeume","year":"2013","unstructured":"Zeume, T., Schwentick, T.: On the quantifier-free dynamic complexity of reachability. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol.\u00a08087, pp. 837\u2013848. Springer, Heidelberg (2013), Full version available at http:\/\/arxiv.org\/abs\/1306.3056."},{"key":"46_CR17","unstructured":"Zeume, T., Schwentick, T.: Dynamic conjunctive queries. In: ICDT 2014, pp. 38\u201349 (2014)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T09:54:51Z","timestamp":1676886891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}