{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T15:40:21Z","timestamp":1734190821062,"version":"3.30.2"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0022-0000(92)90010-g","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"385-410","source":"Crossref","is-referenced-by-count":2,"title":["The invariant problem for binary string structures and the parallel complexity theory of queries"],"prefix":"10.1016","volume":"44","author":[{"given":"Steven","family":"Lindell","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90010-G_BIB1","unstructured":"D. A. M. Barrington, N. Immerman, and H. Straubing, \u201cOn Uniformity within NC1,\u201d revised version, University of Massachusetts COINS Technical Report 89-88"},{"key":"10.1016\/0022-0000(92)90010-G_BIB2","series-title":"19th ACM STOC Symp.","first-page":"123","article-title":"The Boolean formula value problem is in ALOGTIME","author":"Buss","year":"1987"},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90010-G_BIB3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. System Sci."},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90010-G_BIB4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Compul."},{"key":"10.1016\/0022-0000(92)90010-G_BIB5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/S0019-9958(86)80006-7","article-title":"Definability by constant-depth polynomial-size circuits","volume":"70","author":"Denenberg","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90010-G_BIB6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","article-title":"An application of games to the completeness problem for formalized theories","volume":"49","author":"Ehrenfeucht","year":"1961","journal-title":"Fund. Math."},{"key":"10.1016\/0022-0000(92)90010-G_BIB7","series-title":"Complexity of Computation","first-page":"43","article-title":"Generalized first-order spectra and polynomial time recognizable sets","author":"Fagin","year":"1974"},{"key":"10.1016\/0022-0000(92)90010-G_BIB8","article-title":"Sur les Classifications des Systems de Relations","volume":"I","author":"Fra\u00efss\u00e9","year":"1954","journal-title":"Publ. Sci. Univ. Alger"},{"key":"10.1016\/0022-0000(92)90010-G_BIB9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"year":"1979","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/0022-0000(92)90010-G_BIB10"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/0022-0000(92)90010-G_BIB11"},{"issue":"No. 3","key":"10.1016\/0022-0000(92)90010-G_BIB12","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0218043","article-title":"Expressibility and parallel complexity","volume":"18","author":"Immerman","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90010-G_BIB13","doi-asserted-by":"crossref","unstructured":"N. Immerman, Expressibility as a complexity measure: Results and directions, in \u201cProceedings of the second Annual Conference of Structure in Complexity Theory\u201d, pp. 194\u2013202 (a broader survey without proofs)","DOI":"10.1109\/PSCT.1987.10319271"},{"key":"10.1016\/0022-0000(92)90010-G_BIB14","series-title":"Computational Complexity Theory","first-page":"75","article-title":"Descriptive and computational complexity","volume":"Vol. 38","author":"Immerman","year":"1989"},{"key":"10.1016\/0022-0000(92)90010-G_BIB15","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":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90010-G_BIB16","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"No. 5","key":"10.1016\/0022-0000(92)90010-G_BIB17","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90010-G_BIB18","doi-asserted-by":"crossref","unstructured":"N. Immerman and S. Landau, The complexity of iterated multiplication, in \u201cProceedings of the 4th Annual IEEE Conference on Structure in Complexity Theory,\u201d pp. 104\u2013111.","DOI":"10.1109\/SCT.1989.41816"},{"key":"10.1016\/0022-0000(92)90010-G_BIB19","first-page":"365","article-title":"Probabilistic analysis of a canonical numbering algorithm for graphs","volume":"Vol. 34","author":"Karp","year":"1979"},{"article-title":"The Logical Complexity of Queries on Unordered Graphs","year":"1987","author":"Lindell","key":"10.1016\/0022-0000(92)90010-G_BIB20"},{"year":"1991","series-title":"A Logspace Algorithm for Tree Canonization","author":"Lindell","key":"10.1016\/0022-0000(92)90010-G_BIB21"},{"key":"10.1016\/0022-0000(92)90010-G_BIB22","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","article-title":"The graph isomorphism disease","volume":"1","author":"Read","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/0022-0000(92)90010-G_BIB23","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":"1977","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90010-G_BIB24","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90010-G_BIB25","series-title":"Proceedings of the 14th ACM Symposium on the Theory of Computing","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290010G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290010G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T15:14:46Z","timestamp":1734189286000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290010G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["002200009290010G"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90010-g","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}