{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T10:31:33Z","timestamp":1687602693101},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"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":[[1991,1]]},"DOI":"10.1016\/0304-3975(91)90357-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:07:16Z","timestamp":1027638436000},"page":"357-362","source":"Crossref","is-referenced-by-count":3,"title":["A note on some languages in uniform ACC0"],"prefix":"10.1016","volume":"78","author":[{"given":"David A.","family":"Mix Barrington","sequence":"first","affiliation":[]},{"given":"James","family":"Corbett","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90357-8_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a3| formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10.1016\/0304-3975(91)90357-8_BIB2","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","volume":"38","author":"Barrington","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90357-8_BIB3_1","series-title":"Structure in Complexity Theory: Third Annual Conference","first-page":"47","article-title":"On uniformity within NC1","author":"Barrington","year":"1988"},{"key":"10.1016\/0304-3975(91)90357-8_BIB3_2","unstructured":"revised version J. Comput. System Sci., in press. Available as University of Massachusetts COINS Technical Report 89-88."},{"key":"10.1016\/0304-3975(91)90357-8_BIB4","series-title":"Proc. 18th ACM STOC Symp.","first-page":"123","article-title":"The Boolean formula value problem is in ALOGTIME","author":"Buss","year":"1987"},{"issue":"2","key":"10.1016\/0304-3975(91)90357-8_BIB5","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. Comput."},{"key":"10.1016\/0304-3975(91)90357-8_BIB6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90357-8_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","article-title":"Rational sets in commutative monoids","volume":"13","author":"Eilenberg","year":"1969","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(91)90357-8_BIB8","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"},{"key":"10.1016\/0304-3975(91)90357-8_BIB9","first-page":"333","article-title":"Bounded Algol-like languages","volume":"113","author":"Ginsberg","year":"1964","journal-title":"Trans. AMS"},{"key":"10.1016\/0304-3975(91)90357-8_BIB10","series-title":"Proc. 28th IEEE FOCS Symp.","first-page":"99","article-title":"Threshold circuits of bounded depth","author":"Hajnal","year":"1987"},{"key":"10.1016\/0304-3975(91)90357-8_BIB11","series-title":"VLSI Algorithms and Architectures: Proc. 3rd Aegean Workshop on Computing","first-page":"64","article-title":"On some languages in NC1","volume":"319","author":"Ibarra","year":"1988"},{"issue":"3","key":"10.1016\/0304-3975(91)90357-8_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\/0304-3975(91)90357-8_BIB13","series-title":"Proc. 16th ICALP","article-title":"Automata theory meets complexity theory","volume":"372","author":"McKenzie","year":"1989"},{"key":"10.1016\/0304-3975(91)90357-8_BIB14","series-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"issue":"3","key":"10.1016\/0304-3975(91)90357-8_BIB15","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0022-0000(88)90030-X","article-title":"Parallel computation with threshold functions","volume":"36","author":"Parberry","year":"1988","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/0304-3975(91)90357-8_BIB16","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90357-8_BIB17","series-title":"Proc. 14th Ann. Symp. Mathematical Foundations of Computer Science","first-page":"397","article-title":"Logically defined subsets of Nk","volume":"379","author":"P\u00e9ladeau","year":"1989"},{"issue":"4","key":"10.1016\/0304-3975(91)90357-8_BIB18_1","first-page":"598","article-title":"Lower bounds for the size of circuits of bounded depth over a complete basis with logical addition","volume":"41","author":"Razborov","year":"1987","journal-title":"Mathematicheskie Zametki"},{"issue":"4","key":"10.1016\/0304-3975(91)90357-8_BIB18_2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes Acad. Sci. USSR"},{"issue":"3","key":"10.1016\/0304-3975(91)90357-8_BIB19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(91)90357-8_BIB20","series-title":"Proc. 19th ACM STOC Symp.","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1016\/0304-3975(91)90357-8_BIB21","series-title":"Proc. 15th ICALP","first-page":"561","article-title":"Regular languages defined with generalized quantifiers","volume":"317","author":"Straubing","year":"1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591903578?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591903578?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:25:24Z","timestamp":1555179924000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591903578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0304397591903578"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90357-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}