{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T11:16:48Z","timestamp":1690975008332},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":[[1996,4]]},"DOI":"10.1016\/0020-0190(96)00029-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T01:23:41Z","timestamp":1051233821000},"page":"31-33","source":"Crossref","is-referenced-by-count":12,"title":["A note on a theorem of Barrington, Straubing and Th\u00e9rien"],"prefix":"10.1016","volume":"58","author":[{"given":"Herv\u00e9","family":"Caussinus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00029-4_BIB1","article-title":"A note on a theorem of Razborov","author":"Mix Barrington","year":"1986"},{"key":"10.1016\/0020-0190(96)00029-4_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":"Mix Barrington","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(96)00029-4_BIB3","series-title":"Proc. 24th ACM Symp. on Theory of Computing","first-page":"455","article-title":"Representing Boolean functions as polynomials modulo composite numbers","author":"Mix Barrington","year":"1992"},{"key":"10.1016\/0020-0190(96)00029-4_BIB4","article-title":"Superlinear lower bounds for bounded-width branching programs","volume":"50","author":"Barrington","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(96)00029-4_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","article-title":"Non uniform automata over groups","volume":"89","author":"Barrington","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(96)00029-4_BIB6","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":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00029-4_BIB7","series-title":"Proc. 12th Symp. on Theoretical Aspects of Computer Science","first-page":"71","article-title":"Lower bounds for depth-three circuits with equals and mod-gates","author":"Green","year":"1995"},{"key":"10.1016\/0020-0190(96)00029-4_BIB8","series-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science","first-page":"777","article-title":"Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in","author":"Krause","year":"1991"},{"key":"10.1016\/0020-0190(96)00029-4_BIB9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01137685","article-title":"Lower bounds on the size of bounded depth networks over a complete basis with logical addition","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"10.1016\/0020-0190(96)00029-4_BIB10","series-title":"Proc. 19th ACM Symp. on Theory of Computing","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1016\/0020-0190(96)00029-4_BIB11","first-page":"628","article-title":"On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates","volume":"Vol. 2","author":"Smolensky","year":"1990"},{"key":"10.1016\/0020-0190(96)00029-4_BIB12","series-title":"Proc. 25th ACM Symp. on Theory of Computing","first-page":"96","article-title":"Lowers bounds on representing Boolean functions as polynomials in Zm","author":"Tsai","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000294?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:23:34Z","timestamp":1556058214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0020019096000294"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00029-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}