{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T16:16:48Z","timestamp":1686586608253},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":6682,"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":[[1995,4]]},"DOI":"10.1016\/0304-3975(94)00081-s","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"269-282","source":"Crossref","is-referenced-by-count":8,"title":["On the shrinkage exponent for read-once formulae"],"prefix":"10.1016","volume":"141","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Razborov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00081-S_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\/0304-3975(94)00081-S_BIB2","series-title":"Advances in Computer Research, Vol. 5: Randomness and Computation","first-page":"27","article-title":"Amplification of probabilistic Boolean formulas","author":"Boppana","year":"1989"},{"key":"10.1016\/0304-3975(94)00081-S_BIB3","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"258","article-title":"Amplification and percolation","author":"Dubiner","year":"1992"},{"key":"10.1016\/0304-3975(94)00081-S_BIB4","series-title":"How do read-once formulae shrink?","author":"Dubiner","year":"1993"},{"key":"10.1016\/0304-3975(94)00081-S_BIB5","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(94)00081-S_BIB6","article-title":"Computational limitations on small depth circuits","author":"H\u00e5stad","year":"1986"},{"key":"10.1016\/0304-3975(94)00081-S_BIB7","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","first-page":"114","article-title":"The shrinkage exponent is 2","author":"H\u00e5stad","year":"1993"},{"issue":"2","key":"10.1016\/0304-3975(94)00081-S_BIB8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/rsa.3240040202","article-title":"The effect of random restrictions on formulae size","volume":"4","author":"Nisan","year":"1993","journal-title":"Random Structures Algorithms"},{"issue":"2","key":"10.1016\/0304-3975(94)00081-S_BIB9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/rsa.3240040203","article-title":"Shrinkage of de Morgan formulae under restriction","volume":"4","author":"Paterson","year":"1993","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/0304-3975(94)00081-S_BIB10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","article-title":"Short monotone formulae for the majority function","volume":"5","author":"Valiant","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)00081-S_BIB11","series-title":"Proc. 26th IEEE FOCS","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"},{"issue":"1","key":"10.1016\/0304-3975(94)00081-S_BIB12_1","first-page":"70","article-title":"O \u043ce\u0442o\u0434e \u043fo\u043by\u0447e\u043d\u0438\u044f \u0431o\u043bee \u0447e\u043c \u043a\u0432a\u0434pa\u0442\u0438\u0447\u043d\u044b\u0447 \u043d\u0438\u0436\u043d\u0438\u0447 o\u0446e\u043do\u043a \u0434\u043b\u044f c\u043bo\u0436\u043doc\u0442\u0438 \u043f-c\u0447e\u043c","volume":"42","author":"A\u043d\u0434pee\u0432","year":"1987","journal-title":"Becmhuk M\u0393y, cep. mamem mexah."},{"issue":"1","key":"10.1016\/0304-3975(94)00081-S_BIB12_2","first-page":"63","article-title":"On a method for obtaining more than quadratic effective lower bounds for the complexity of \u03c0-schemes","volume":"42","author":"Andreev","year":"1987","journal-title":"Moscow Univ. Math. Bull"},{"issue":"3","key":"10.1016\/0304-3975(94)00081-S_BIB13_1","first-page":"553","article-title":"O pea\u043b\u0438\u0437a\u0446\u0438\u0438 \u043b\u0438\u043de\u0439\u043d\u044b\u0447 \u0444y\u043d\u043a\u0446\u0438\u0439 \u0444op\u043cy\u043ba\u043c\u0438 \u0432 \u0431a\u0437\u0438ce &, v, \u2014","volume":"136","author":"Cy\u0431\u0431o\u0442o\u0432c\u043aa\u044f","year":"1961","journal-title":"\u0434AH CCCP"},{"key":"10.1016\/0304-3975(94)00081-S_BIB13_2","first-page":"110","article-title":"Realizations of linear functions by formulas using +, \u2217, \u2212","volume":"2","author":"Subbotovskaya","year":"1961","journal-title":"Soviet Mathematics Doklady"},{"issue":"1","key":"10.1016\/0304-3975(94)00081-S_BIB14_1","first-page":"35","article-title":"O c\u043bo\u0436\u043doc\u0442\u0438 pea\u043b\u0438\u0437a\u0446\u0438\u0438 \u043b\u0438\u043de\u0439\u043do\u0439 \u0444y\u043d\u043a\u0446\u0438\u0438 \u0432 \u043a\u043bacce \u041f-c\u0447e\u043c","volume":"9","author":"Xpa\u043f\u0447e\u043d\u043ao","year":"1971","journal-title":"Mamem. \u0437amemku"},{"key":"10.1016\/0304-3975(94)00081-S_BIB14_2","first-page":"21","article-title":"Complexity of the realization of a linear function in the class of \u03c0-circuits","volume":"9","author":"Khrapchenko","year":"1971","journal-title":"Math. Notes Acad. Sciences USSR"},{"issue":"1","key":"10.1016\/0304-3975(94)00081-S_BIB15_1","first-page":"83","article-title":"O\u0431 o\u0434\u043do\u043c \u043ce\u0442o\u0434e \u043fo\u043bye\u043d\u0438\u044f \u043d\u0438\u0436\u043d\u0438\u043a o\u0434e\u043do\u043a c\u043bo\u0436\u043doc\u0442\u0438 \u041f-c\u0447e\u043c","volume":"10","author":"Xpa\u043fye\u043d\u043ao","year":"1971","journal-title":"Mamem. \u0437amemku"},{"key":"10.1016\/0304-3975(94)00081-S_BIB15_2","first-page":"474","article-title":"A method of determining lower bounds for the complexity of \u03a0-schemes","volume":"10","author":"Khrapchenko","year":"1971","journal-title":"Math. Notes Acad. Sciences USSR"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400081S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400081S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T22:54:04Z","timestamp":1556319244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400081S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["030439759400081S"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00081-s","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}