{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:57:40Z","timestamp":1648565860933},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":[[1994,5]]},"DOI":"10.1016\/0020-0190(94)00036-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"211-216","source":"Crossref","is-referenced-by-count":7,"title":["Bounded-width polynomial-size Boolean formulas compute exactly those functions in AC0"],"prefix":"10.1016","volume":"50","author":[{"given":"Sorin","family":"Istrail","sequence":"first","affiliation":[]},{"given":"Dejan","family":"Zivkovic","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00036-0_BIB1","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 Appl. Logic"},{"key":"10.1016\/0020-0190(94)00036-0_BIB2","first-page":"1","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","author":"Barrington","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)00036-0_BIB3","article-title":"The complexity of finite functions","author":"Boppana","year":"1989","journal-title":"MIT\/LCS Tech. Rept. No. 405"},{"key":"10.1016\/0020-0190(94)00036-0_BIB4","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(94)00036-0_BIB5","first-page":"525","article-title":"On time-hardware complexity tradeoffs for Boolean functions","author":"Spira","year":"1971","journal-title":"Proc. 4th Hawaii Symp. on System Sciences"},{"key":"10.1016\/0020-0190(94)00036-0_BIB6","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"},{"key":"10.1016\/0020-0190(94)00036-0_BIB7","series-title":"Ph.D. Thesis","article-title":"Non-probabilistic techniques in circuit complexity","author":"Zivkovic","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000360?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:22:12Z","timestamp":1555132932000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0020019094000360"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00036-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}