{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:44Z","timestamp":1775282324903,"version":"3.50.1"},"reference-count":41,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":7382,"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":[[1993,5]]},"DOI":"10.1016\/0304-3975(93)90214-e","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"167-183","source":"Crossref","is-referenced-by-count":39,"title":["Probabilistic polynomials, AC0 functions and the polynomial-time hierarchy"],"prefix":"10.1016","volume":"113","author":[{"given":"Jun","family":"Tarui","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90214-E_BIB1","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/SFCS.1989.63538","article-title":"A note on the power of threshold circuits","author":"Allender","year":"1989","journal-title":"Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90214-E_BIB2","first-page":"158","article-title":"On the power of uniform families of constant depth threshold circuits","volume":"Vol. 452","author":"Allender","year":"1990"},{"key":"10.1016\/0304-3975(93)90214-E_BIB3","first-page":"402","article-title":"The expressive power of voting polynomials","author":"Aspnes","year":"1991","journal-title":"Proc. 23rd Ann. ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(93)90214-E_BIB4","first-page":"455","article-title":"Representing Boolean functions as polynomials modulo composite numbers","author":"Barrington","year":"1992","journal-title":"Proc. 24th Ann. ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(93)90214-E_BIB5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90084-S","article-title":"Counting classes: thresholds, parity, mods, and fewness","volume":"103","author":"Beigel","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90214-E_BIB6","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/SCT.1991.160270","article-title":"The perceptron strikes back","author":"Beigel","year":"1991","journal-title":"Proc. 6th Ann. IEEE Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(93)90214-E_BIB7","first-page":"1","article-title":"PP is closed under intersection","author":"Beigel","year":"1991","journal-title":"Proc. 23rd Ann. ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(93)90214-E_BIB8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90214-E_BIB9","series-title":"Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity","first-page":"757","article-title":"The complexity of finite functions","author":"Boppana","year":"1990"},{"key":"10.1016\/0304-3975(93)90214-E_BIB10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02090768","article-title":"On the power of parity polynomial time","volume":"23","author":"Cai","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90214-E_BIB11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90214-E_BIB12","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statistics"},{"key":"10.1016\/0304-3975(93)90214-E_BIB13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/SCT.1991.160241","article-title":"Gap-definable counting classes","author":"Fenner","year":"1991","journal-title":"Proc. 6th Ann. IEEE Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(93)90214-E_BIB14","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(93)90214-E_BIB15","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90214-E_BIB16","doi-asserted-by":"crossref","unstructured":"F. Green, On the power of deterministic reductions of C = P, Math. Systems Theory, to appear.","DOI":"10.1007\/BF01202284"},{"key":"10.1016\/0304-3975(93)90214-E_BIB17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(90)90081-R","article-title":"Relation among MOD-classes","volume":"74","author":"Hertrampf","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90214-E_BIB18","series-title":"Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity","first-page":"67","article-title":"A catalog of complexity classes","author":"Johnson","year":"1990"},{"key":"10.1016\/0304-3975(93)90214-E_BIB19","doi-asserted-by":"crossref","unstructured":"R. Kannan, H. Venkateswaran, V. Vinay and A. Yao, A circuit-based proof of Toda's theorem, Inform. and Comput., to appear.","DOI":"10.1006\/inco.1993.1033"},{"key":"10.1016\/0304-3975(93)90214-E_BIB20","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1109\/SFCS.1989.63537","article-title":"Constant depth circuits, Fourier transform, and learnability","author":"Linial","year":"1989","journal-title":"Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90214-E_BIB21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/SWAT.1972.29","article-title":"The equivalence problem for regular expressions with squaring requires exponential time","author":"Meyer","year":"1972","journal-title":"Proc. 13th Ann. IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(93)90214-E_BIB22","series-title":"Perceptrons","author":"Minsky","year":"1969"},{"key":"10.1016\/0304-3975(93)90214-E_BIB23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1307\/mmj\/1028999029","article-title":"Rational approximation to |x|","volume":"11","author":"Newman","year":"1964","journal-title":"Michigan Math. J."},{"key":"10.1016\/0304-3975(93)90214-E_BIB24","author":"Ogiwara","year":"1990","journal-title":"On the computational power of exact counting"},{"key":"10.1016\/0304-3975(93)90214-E_BIB25","first-page":"269","article-title":"Two remarks on the power of counting","volume":"Vol. 145","author":"Papadimitriou","year":"1983"},{"key":"10.1016\/0304-3975(93)90214-E_BIB26","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/FSCS.1990.89559","article-title":"On threshold circuits for parity","author":"Paturi","year":"1990","journal-title":"Proc. 31st Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90214-E_BIB27","series-title":"Research Report RC 15340 (# 68237)","article-title":"Lecture notes on randomized algorithms","author":"Raghavan","year":"1990"},{"key":"10.1016\/0304-3975(93)90214-E_BIB28","first-page":"598","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":"Mat. Zametki"},{"key":"10.1016\/0304-3975(93)90214-E_BIB29","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0022-0000(89)90020-2","article-title":"Probabilistic complexity classes and lowness","volume":"39","author":"Sch\u00f6ning","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90214-E_BIB30","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 Ann. ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(93)90214-E_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90214-E_BIB32","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1109\/SCT.1991.160282","article-title":"Degree complexity of Boolean functions and its applications to relativized separations","author":"Tarui","year":"1991","journal-title":"Proc. 6th Ann. IEEE Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(93)90214-E_BIB33","first-page":"238","article-title":"Randomized polynomials, threshold circuits, and the polynomial hierarchy","volume":"Vol. 480","author":"Tarui","year":"1991"},{"key":"10.1016\/0304-3975(93)90214-E_BIB34","author":"Tarui","year":"1992","journal-title":"On singleton selectors and probabilistic polynomials"},{"key":"10.1016\/0304-3975(93)90214-E_BIB35_1","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","article-title":"PP is as hard as the polynomial-time hierarchy","volume":"20","author":"Toda","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90214-E_BIB35_2","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/SFCS.1989.63527","article-title":"On the computational power of PP and \u2295 P","author":"Toda","year":"1989","journal-title":"Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90214-E_BIB36","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1137\/0221023","article-title":"Counting classes are at least as hard as the polynomial-time hierarchy","volume":"21","author":"Toda","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90214-E_BIB37","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"7","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90214-E_BIB38","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90214-E_BIB39","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","article-title":"The complexity of combinatorial problems with succinct input representation","volume":"23","author":"Wagner","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(93)90214-E_BIB40","first-page":"383","article-title":"Probabilistic quantifiers, adversaries, and complexity classes: overview","volume":"Vol. 223","author":"Zachos","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390214E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390214E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:19:32Z","timestamp":1580883572000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390214E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["030439759390214E"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90214-e","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}