{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:26:36Z","timestamp":1648675596871},"reference-count":29,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":[[1995,3]]},"DOI":"10.1016\/0020-0190(94)00221-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"321-327","source":"Crossref","is-referenced-by-count":11,"title":["A note on the power of majority gates and modular gates"],"prefix":"10.1016","volume":"53","author":[{"given":"Mikael","family":"Goldmann","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00221-J_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\/0020-0190(94)00221-J_BIB2","series-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science","first-page":"580","article-title":"A note on the power of threshold circuits","author":"Allender","year":"1989"},{"issue":"2","key":"10.1016\/0020-0190(94)00221-J_BIB3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/inco.1994.1057","article-title":"Depth reduction for circuits of unbounded fan-in","volume":"112","author":"Allender","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(94)00221-J_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579196","article-title":"The monotone circuit complexity of boolean functions","volume":"7","author":"Alon","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(94)00221-J_BIB5_1","series-title":"Proc. 24th ACM Symp. on Theory of Computing","first-page":"455","article-title":"Representing boolean functions as polynomials modulo composite numbers","author":"Barrington","year":"1992"},{"key":"10.1016\/0020-0190(94)00221-J_BIB5_2","unstructured":"also in: Computational Complexity, to appear."},{"key":"10.1016\/0020-0190(94)00221-J_BIB6","series-title":"Proc. 32th IEEE Symp. on Foundations of Computer Science","first-page":"783","article-title":"On ACC","author":"Beigel","year":"1991"},{"issue":"2","key":"10.1016\/0020-0190(94)00221-J_BIB7","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/0403015","article-title":"Harmonic analysis of polynomial threshold functions","volume":"3","author":"Bruck","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(94)00221-J_BIB8","series-title":"Proc. 31th IEEE Symp. on Foundations of Computer Science","first-page":"632","article-title":"Polynomial threshold functions, AC0 functions and spectral norms","author":"Bruck","year":"1990"},{"key":"10.1016\/0020-0190(94)00221-J_BIB9","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. System Theory"},{"key":"10.1016\/0020-0190(94)00221-J_BIB10_1","series-title":"Proc. 7th Ann. Structure in Complexity Theory Conf.","first-page":"2","article-title":"Majority gates vs. general weighted threshold gates","author":"Goldmann","year":"1992"},{"key":"10.1016\/0020-0190(94)00221-J_BIB10_2","unstructured":"also in: Computational Complexity, to appear."},{"key":"10.1016\/0020-0190(94)00221-J_BIB11","series-title":"Proc. 28th IEEE Symp. on Foundations of Computer Science","first-page":"99","article-title":"Threshold circuits of bounded depth","author":"Hajnal","year":"1987"},{"key":"10.1016\/0020-0190(94)00221-J_BIB12","series-title":"Computational Limitations of Small-Depth Circuits","author":"H\u00e5stad","year":"1986"},{"issue":"2","key":"10.1016\/0020-0190(94)00221-J_BIB13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01272517","article-title":"On the power of small-depth threshold circuits","volume":"1","author":"H\u00e5stad","year":"1991","journal-title":"Computational Complexity"},{"key":"10.1016\/0020-0190(94)00221-J_BIB14","series-title":"On the computational power of threshold circuits with MOD-gates","author":"Krause","year":"1993"},{"key":"10.1016\/0020-0190(94)00221-J_BIB15","series-title":"Proc. 32th 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(94)00221-J_BIB16","first-page":"301","article-title":"The communication complexity of threshold gates","volume":"Volume I","author":"Nisan","year":"1993"},{"issue":"4","key":"10.1016\/0020-0190(94)00221-J_BIB17_1","first-page":"798","article-title":"Lower bounds on the monotone complexity of some boolean functions","volume":"281","author":"Razborov","year":"1985","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0020-0190(94)00221-J_BIB17_2","first-page":"354","volume":"31","author":"Razborov","year":"1985","journal-title":"Soviet Math. Dokl."},{"issue":"6","key":"10.1016\/0020-0190(94)00221-J_BIB18_1","first-page":"887","article-title":"A lower bound on the monotone network complexity of the logical permanent","volume":"37","author":"Razborov","year":"1985","journal-title":"Mat. Zametki"},{"issue":"6","key":"10.1016\/0020-0190(94)00221-J_BIB18_2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF01157687","volume":"37","author":"Razborov","year":"1985","journal-title":"Math. Notes of the Academy of Sciences of the USSR"},{"issue":"4","key":"10.1016\/0020-0190(94)00221-J_BIB19_1","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"},{"issue":"4","key":"10.1016\/0020-0190(94)00221-J_BIB19_2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes of the Academy of Sciences of the USSR"},{"key":"10.1016\/0020-0190(94)00221-J_BIB20","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"},{"key":"10.1016\/0020-0190(94)00221-J_BIB21","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"},{"issue":"1","key":"10.1016\/0020-0190(94)00221-J_BIB22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02122563","article-title":"The gap between monotone and non-monotone circuit complexity is exponential","volume":"8","author":"Tardos","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(94)00221-J_BIB23","series-title":"Proc. 26th IEEE Symp. on Foundations of Computer Science","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"},{"key":"10.1016\/0020-0190(94)00221-J_BIB24","series-title":"Proc. 31th IEEE Symp. on Foundations of Computer Science","first-page":"619","article-title":"On ACC and threshold circuits","author":"Yao","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400221J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400221J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:21Z","timestamp":1555297101000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400221J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["002001909400221J"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00221-j","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}