{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:59:23Z","timestamp":1775282363684,"version":"3.50.1"},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":8932,"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":[[1989,2]]},"DOI":"10.1016\/0022-0000(89)90037-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"150-164","source":"Crossref","is-referenced-by-count":360,"title":["Bounded-width polynomial-size branching programs recognize exactly those languages in NC1"],"prefix":"10.1016","volume":"38","author":[{"given":"David A.","family":"Barrington","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90037-8_BIB1","series-title":"Proceedings, 18th ACM STOC","first-page":"30","article-title":"Two Lower Bounds for Branching Programs","author":"Ajtai","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a311 formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Applied Logic"},{"key":"10.1016\/0022-0000(89)90037-8_BIB3","series-title":"Proceedings, 27th IEEE FOCS","first-page":"410","article-title":"Meanders, Ramsey Theory, and lower bounds for branching programs","author":"Alon","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB4","unstructured":"D. A. Barrington, \u201cWidth-3 Permutation Branching Programs,\u201d Technical Memorandum TM-293, MIT Laboratory for Computer Science."},{"key":"10.1016\/0022-0000(89)90037-8_BIB5","series-title":"Proceedings, 18th ACM STOC","first-page":"1","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","author":"Barrington","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB6","article-title":"Bounded-Width Branching Programs","author":"Barrington","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB7","series-title":"Proceedings, 19th ACM STOC","article-title":"Finite monoids and the fine structure of NC1","author":"Barrington","year":"1987"},{"key":"10.1016\/0022-0000(89)90037-8_BIB8","series-title":"Proceedings, 25th IEEE FOCS","first-page":"1","article-title":"Log-depth circuits for division and related problems","author":"Beame","year":"1984"},{"key":"10.1016\/0022-0000(89)90037-8_BIB9","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","article-title":"Logical reversibility of computation","volume":"17","author":"Bennett","year":"1973","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0022-0000(89)90037-8_BIB10_1","series-title":"Proceedings, 15th ACM STOC","first-page":"87","article-title":"Bounds for width two branching programs","author":"Borodin","year":"1983"},{"key":"10.1016\/0022-0000(89)90037-8_BIB10_2","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1137\/0215040","volume":"15","author":"Borodin","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90037-8_BIB11","series-title":"Proceedings, 15th ACM STOC","first-page":"94","article-title":"Multiparty protocols","author":"Chandra","year":"1983"},{"key":"10.1016\/0022-0000(89)90037-8_BIB12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90037-8_BIB13","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\/0022-0000(89)90037-8_BIB14","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\/0022-0000(89)90037-8_BIB15","series-title":"Problems Complete for Deterministic Logarithmic Space","author":"Cook","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(85)90045-3","article-title":"Bounded depth, polynomial-size circuits for symmetric functions","volume":"36","author":"Fagin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90037-8_BIB17_1","series-title":"Proceedings, 22nd IEEE FOCS","first-page":"260","article-title":"Parity, circuits and the polynomial time hierarchy","author":"Furst","year":"1981"},{"key":"10.1016\/0022-0000(89)90037-8_BIB17_2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(89)90037-8_BIB18","series-title":"There are no p-complete families of symmetric Boolean functions","author":"Ger\u00e9b-Graus","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB19","series-title":"Proceedings, 18th ACM STOC","first-page":"6","article-title":"Almost optimal lower bounds for small depths circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB20","series-title":"Characterizing bounded width, manuscript","author":"Hoover","year":"1983"},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90037-8_BIB21","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0196-6774(86)90011-8","article-title":"The NP-completeness column: An ongoing guide","volume":"7","author":"Johnson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(89)90037-8_BIB22_1","series-title":"Proceedings, 1977 Intl. Conf. on Parallel Processing","first-page":"218","article-title":"Parallel prefix computation","author":"Ladner","year":"1980"},{"key":"10.1016\/0022-0000(89)90037-8_BIB22_2","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90037-8_BIB23","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","article-title":"Representation of switching functions by binary decision programs","volume":"38","author":"Lee","year":"1959","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0022-0000(89)90037-8_BIB24","article-title":"A Fast Algorithm for the String Editing Problem and Decision Graph Complexity","author":"Masek","year":"1976"},{"key":"10.1016\/0022-0000(89)90037-8_BIB25","series-title":"Rudiments of a branching program based complexity theory","author":"Meinel","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB26","series-title":"Structure in Complexity Theory","first-page":"272","article-title":"Parallel computation with threshold functions","volume":"Vol. 223","author":"Parberry","year":"1986"},{"key":"10.1016\/0022-0000(89)90037-8_BIB27","series-title":"Proceedings, Conference on the Mathematical Foundations of Computer Science","first-page":"480","article-title":"A lower bound on complexity of branching programs","author":"P\u00fadlak","year":"1984"},{"key":"10.1016\/0022-0000(89)90037-8_BIB28","unstructured":"A. A. Razborov, Lower bounds for the size of circuits of bounded depth with basis{&, \u2295}, preprint [Russian]; Math. Notes, in press."},{"issue":"No 3","key":"10.1016\/0022-0000(89)90037-8_BIB29","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\/0022-0000(89)90037-8_BIB30","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/321724.321731","article-title":"Computational work and time on finite machines","volume":"19","author":"Savage","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90037-8_BIB31","doi-asserted-by":"crossref","unstructured":"J. B. Shearer, personal communications, 1985.","DOI":"10.1145\/4021.4023"},{"key":"10.1016\/0022-0000(89)90037-8_BIB32_1","series-title":"Proceeedings, 22nd IEEE FOCS","first-page":"244","article-title":"A complexity theory based on Boolean algebra","author":"Skyum","year":"1981"},{"key":"10.1016\/0022-0000(89)90037-8_BIB32_2","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/3149.3158","volume":"32","author":"Skyum","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90037-8_BIB33","series-title":"Proceedings, 19th ACM STOC","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1016\/0022-0000(89)90037-8_BIB34","series-title":"Proceedings, 24th IEEE FOCS","first-page":"420","article-title":"Lower bounds by probabilistic arguments","author":"Yao","year":"1983"},{"key":"10.1016\/0022-0000(89)90037-8_BIB35","series-title":"Proceedings, ACM STOC","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"},{"key":"10.1016\/0022-0000(89)90037-8_BIB36","article-title":"The Theory of Groups","author":"Zassenhaus","year":"1958"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900378?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900378?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:54:35Z","timestamp":1550325275000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0022000089900378"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90037-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}