{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:19:04Z","timestamp":1703186344916},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0020-0190(89)90052-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"251-256","source":"Crossref","is-referenced-by-count":14,"title":["On the relative complexity of some languages in NC1"],"prefix":"10.1016","volume":"32","author":[{"given":"David A.","family":"Mix Barrington","sequence":"first","affiliation":[]},{"given":"James","family":"Corbett","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90052-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u221111 formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0020-0190(89)90052-5_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\/0020-0190(89)90052-5_BIB3","unstructured":"P. Berman, Personal Communication."},{"key":"10.1016\/0020-0190(89)90052-5_BIB4","series-title":"Proc. 3rd Ann. Conf. on Structure in Complexity Theory","first-page":"47","article-title":"On uniformity within NC1","author":"Barrington","year":"1988"},{"key":"10.1016\/0020-0190(89)90052-5_BIB5","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1145\/48014.63138","article-title":"Finite monoids and the fine structure of NC1","volume":"35","author":"Barrington","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90052-5_BIB6","first-page":"123","article-title":"The Boolean formula value problem is in ALOGTIME","author":"Buss","year":"1987","journal-title":"Proc. 18th ACM STOC Symp."},{"key":"10.1016\/0020-0190(89)90052-5_BIB7","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\/0020-0190(89)90052-5_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\/0020-0190(89)90052-5_BIB9","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":"Hajnal","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(89)90052-5_BIB10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(88)90047-6","article-title":"Some subclasses of context-free languages in NC1","volume":"29","author":"Ibarra","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90052-5_BIB11","first-page":"272","article-title":"Parallel computation with threshold functions","volume":"Vol. 223","author":"Parberry","year":"1986"},{"key":"10.1016\/0020-0190(89)90052-5_BIB12_1","first-page":"598","article-title":"Lower bounds for the size of circuits of bounded depth with basis {&, \u2295}","volume":"41","author":"Razborov","year":"1987","journal-title":"Mat. Zametki"},{"key":"10.1016\/0020-0190(89)90052-5_BIB12_2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01137685","article-title":"Lower bounds for the size of circuits of bounded depth with basis {&, \u2295}","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"10.1016\/0020-0190(89)90052-5_BIB13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0019-9958(72)90205-7","article-title":"Language recognition by marking automata","volume":"20","author":"Ritchie","year":"1972","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(89)90052-5_BIB14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"21","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(89)90052-5_BIB15","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987","journal-title":"Proc. 19th ACM STOC Symp."},{"key":"10.1016\/0020-0190(89)90052-5_BIB16","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the tape complexity of deterministic context-free languages","volume":"25","author":"Sudborough","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90052-5_BIB17","first-page":"186","article-title":"Circuits and local computation","author":"Yao","year":"1989","journal-title":"Proc. 21st ACM STOC Symp."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900525?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900525?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:53:55Z","timestamp":1555073635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089900525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0020019089900525"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90052-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}