乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:51:39Z","timestamp":1740106299279,"version":"3.37.3"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002428","name":"FWF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"DFG","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Research Foundation Flanders","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1016\/j.jcss.2021.02.003","type":"journal-article","created":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T16:17:31Z","timestamp":1614701851000},"page":"145-163","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Descriptive complexity of deterministic polylogarithmic time and space"],"prefix":"10.1016","volume":"119","author":[{"given":"Flavio","family":"Ferrarotti","sequence":"first","affiliation":[]},{"given":"Sen\u00e9n","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Mar\u00eda","family":"Turull Torres","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Van den Bussche","sequence":"additional","affiliation":[]},{"given":"Jonni","family":"Virtema","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2007","series-title":"Finite Model Theory and Its Applications","author":"Gr\u00e4del","key":"10.1016\/j.jcss.2021.02.003_br0010"},{"key":"10.1016\/j.jcss.2021.02.003_br0020","series-title":"Computation and Proof Theory","first-page":"175","article-title":"Toward logic tailored for computational complexity","volume":"vol. 1104","author":"Gurevich","year":"1984"},{"year":"1999","series-title":"Descriptive Complexity","author":"Immerman","key":"10.1016\/j.jcss.2021.02.003_br0030"},{"key":"10.1016\/j.jcss.2021.02.003_br0040","series-title":"Complexity of Computation","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"vol. 7","author":"Fagin","year":"1974"},{"key":"10.1016\/j.jcss.2021.02.003_br0050","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inf. Control"},{"key":"10.1016\/j.jcss.2021.02.003_br0060","series-title":"Proceedings 14th ACM Symposium on the Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"},{"year":"1995","series-title":"Foundations of Databases","author":"Abiteboul","key":"10.1016\/j.jcss.2021.02.003_br0070"},{"key":"10.1016\/j.jcss.2021.02.003_br0080","series-title":"Proceedings of the 14th Annual ACM Symposium on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/j.jcss.2021.02.003_br0090","series-title":"Logic, Language, Information, and Computation \u2013 Proceedings of the 26th International Workshop","first-page":"208","article-title":"Descriptive complexity of deterministic polylogarithmic time","volume":"vol. 11541","author":"Ferrarotti","year":"2019"},{"key":"10.1016\/j.jcss.2021.02.003_br0100","series-title":"32nd Annual ACM\/IEEE Symposium on Logic in Computer Science","first-page":"1","article-title":"Descriptive complexity of linear equation systems and applications to propositional proof complexity","author":"Grohe","year":"2017"},{"issue":"3","key":"10.1016\/j.jcss.2021.02.003_br0110","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","article-title":"Number of quantifiers is better than number of tape cells","volume":"22","author":"Immerman","year":"1981","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.jcss.2021.02.003_br0120","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Mix Barrington","year":"1990","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2021.02.003_br0130","series-title":"Proceedings of the Seventh Annual Structure in Complexity Theory Conference","first-page":"86","article-title":"Quasipolynomial size circuit classes","author":"Mix Barrington","year":"1992"},{"key":"10.1016\/j.jcss.2021.02.003_br0140","series-title":"20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","first-page":"133","article-title":"The polylog-time hierarchy captured by restricted second-order logic","author":"Ferrarotti","year":"2018"},{"issue":"1","key":"10.1016\/j.jcss.2021.02.003_br0150","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theor. Comput. Sci."},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitriou","key":"10.1016\/j.jcss.2021.02.003_br0160"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.jcss.2021.02.003_br0170"},{"issue":"4","key":"10.1016\/j.jcss.2021.02.003_br0180","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"year":"1995","series-title":"Limits to Parallel Computation: P-Completeness Theory","author":"Greenlaw","key":"10.1016\/j.jcss.2021.02.003_br0190"},{"issue":"1","key":"10.1016\/j.jcss.2021.02.003_br0200","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0215017","article-title":"Logarithmic depth circuits for algebraic functions","volume":"15","author":"Reif","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2021.02.003_br0210","series-title":"Foundations of Computational Mathematics","first-page":"267","article-title":"The space complexity of elimination theory: upper bounds","author":"Matera","year":"1997"},{"issue":"1","key":"10.1016\/j.jcss.2021.02.003_br0220","article-title":"An algorithm for the computation of the rank of integer matrices in polylogarithmic space","volume":"4","author":"Grosso","year":"2000","journal-title":"Electron. J. Chil. Soc. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.jcss.2021.02.003_br0230","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0304-3975(01)00108-6","article-title":"Computing LOGCFL certificates","volume":"270","author":"Gottlob","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2021.02.003_br0240","series-title":"Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"124","article-title":"Tractable database design through bounded treewidth","author":"Gottlob","year":"2006"},{"issue":"3","key":"10.1016\/j.jcss.2021.02.003_br0250","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.is.2009.09.003","article-title":"Tractable database design and datalog abduction through bounded treewidth","volume":"35","author":"Gottlob","year":"2010","journal-title":"Inf. Syst."},{"issue":"3","key":"10.1016\/j.jcss.2021.02.003_br0260","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jcss.1995.1035","article-title":"Circuits, matrices, and nonassociative computation","volume":"50","author":"Beaudry","year":"1995","journal-title":"J. Comput. Syst. Sci."},{"year":"2017","series-title":"Descriptive Complexity, Canonisation, and Definable Graph Structure Theory","author":"Grohe","key":"10.1016\/j.jcss.2021.02.003_br0270"},{"year":"1999","series-title":"Finite Model Theory","author":"Ebbinghaus","key":"10.1016\/j.jcss.2021.02.003_br0280"},{"year":"2004","series-title":"Elements of Finite Model Theory","author":"Libkin","key":"10.1016\/j.jcss.2021.02.003_br0290"},{"key":"10.1016\/j.jcss.2021.02.003_br0300","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","article-title":"Fixed-point extensions of first-order logic","volume":"32","author":"Gurevich","year":"1986","journal-title":"Ann. Pure Appl. Log."},{"key":"10.1016\/j.jcss.2021.02.003_br0310","article-title":"Sorting and Searching","volume":"vol. 3","author":"Knuth","year":"1998"},{"key":"10.1016\/j.jcss.2021.02.003_br0320","series-title":"Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science","first-page":"267","article-title":"The quest for a logic capturing PTIME","author":"Grohe","year":"2008"},{"issue":"4","key":"10.1016\/j.jcss.2021.02.003_br0330","doi-asserted-by":"crossref","first-page":"1562","DOI":"10.1137\/100791075","article-title":"Sublinear time algorithms","volume":"25","author":"Rubinfeld","year":"2011","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jcss.2021.02.003_br0340","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.jcss.2003.09.002","article-title":"Graph properties checkable in linear time in the number of vertices","volume":"68","author":"Grandjean","year":"2004","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000021000180?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000021000180?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T17:07:31Z","timestamp":1672160851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000021000180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":34,"alternative-id":["S0022000021000180"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2021.02.003","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2021,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Descriptive complexity of deterministic polylogarithmic time and space","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2021.02.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}