{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:34Z","timestamp":1775282314906,"version":"3.50.1"},"reference-count":37,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0022-0000(93)90001-d","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"129-154","source":"Crossref","is-referenced-by-count":150,"title":["Threshold circuits of bounded depth"],"prefix":"10.1016","volume":"46","author":[{"given":"Andr\u00e1s","family":"Hajnal","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Maass","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[]},{"given":"M\u00e1ri\u00f3","family":"Szegedy","sequence":"additional","affiliation":[]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90001-D_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":"1984","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0022-0000(93)90001-D_BIB2","series-title":"Proceedings, 16th Annu. ACM Sympos, Theory of Comput.","first-page":"471","article-title":"A theorem on probabilistic constant depth computations","author":"Ajtai","year":"1984"},{"key":"10.1016\/0022-0000(93)90001-D_BIB3","series-title":"IEEE 27th Annu. Found of Comput. Sci.","first-page":"337","article-title":"Complexity classes in communication complexity","author":"Babai","year":"1986"},{"key":"10.1016\/0022-0000(93)90001-D_BIB4","series-title":"18th Annu. Proceedings, ACM Sympos Theory of Comput.","first-page":"1","article-title":"Bounded-width, polynomial size branching programs recognize exactly those languages in NC1","author":"Barrington","year":"1986"},{"key":"10.1016\/0022-0000(93)90001-D_BIB5","series-title":"19th Annu. Proceedings, ACM Sympos. Theory of Comput.","first-page":"101","article-title":"Finite monoids and the fine structure of NC1","author":"Barrington","year":"1987"},{"key":"10.1016\/0022-0000(93)90001-D_BIB6","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0215070","article-title":"Log depth circuits for division and related problems","volume":"15","author":"Beame","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90001-D_BIB7","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0022-0000(93)90001-D_BIB8","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90001-D_BIB9","series-title":"26th Annu. IEEE Found. of Comput. Sci.","first-page":"429","article-title":"Unbiased bits from sources of weak randomness and probabilistic communication complexity","author":"Chor","year":"1985"},{"key":"10.1016\/0022-0000(93)90001-D_BIB10","first-page":"59","article-title":"Upper bound for the redundancy of self-correcting arrangements of unreliable functional elements","volume":"13","author":"Dobrushin","year":"1977","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0022-0000(93)90001-D_BIB11","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0022-0000(93)90001-D_BIB12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(85)90045-3","article-title":"Bounded depth, polynomial size circuits for symmetric functions","volume":"36","author":"Fagin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(93)90001-D_BIB13","series-title":"22nd Annu. IEEE Found. of Comput. Sci.","first-page":"260","article-title":"Parity, circuits, and the polynomial time hierarchy","author":"Furst","year":"1981"},{"key":"10.1016\/0022-0000(93)90001-D_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0019-9958(84)80062-5","article-title":"A logic for constant depth circuits","volume":"61","author":"Gurevich","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(93)90001-D_BIB15","series-title":"18th Annu. Proceedings, ACM Sympos. Theory of Comput.","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/0022-0000(93)90001-D_BIB16","series-title":"15th Annu. Proceedings, ACM Sympos. Theory of Comput.","first-page":"347","article-title":"Languages which capture complexity classes","author":"Immerman","year":"1983"},{"key":"10.1016\/0022-0000(93)90001-D_BIB17","series-title":"Telling graphs apart: A first order approach to graph isomorphism","author":"Immerman","year":"1984"},{"key":"10.1016\/0022-0000(93)90001-D_BIB18_1","first-page":"5","article-title":"Implementing the algebra of logic functions in terms of bounded depth formulas in the basis +, \u2217, \u2212","volume":"136","author":"Lupanov","year":"1961","journal-title":"Dokl. Acad. Nauk. SSSR"},{"key":"10.1016\/0022-0000(93)90001-D_BIB18_2","first-page":"1041","article-title":"Implementing the algebra of logic functions in terms of bounded depth formulas in the basis +, \u2217, -","volume":"136","author":"Lupanov","year":"1961","journal-title":"Dokl. Acad. Nauk. SSSR"},{"key":"10.1016\/0022-0000(93)90001-D_BIB18_3","first-page":"107","volume":"6","year":"1961","journal-title":"Sov. Phys. Dokl."},{"key":"10.1016\/0022-0000(93)90001-D_BIB19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0206026","article-title":"The depth of all Boolean functions","volume":"6","author":"McColl","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90001-D_BIB20","series-title":"Perceptrons: An Introduction to Computational Geometry","author":"Minsky","year":"1972"},{"key":"10.1016\/0022-0000(93)90001-D_BIB21","series-title":"Automata Studies","first-page":"43","article-title":"Probabilistic logics and the synthesis of reliable organisms from unreliable components","author":"Von Neumann","year":"1956"},{"key":"10.1016\/0022-0000(93)90001-D_BIB22","series-title":"Structure in Complexity Theory","first-page":"272","article-title":"Parallel computation with threshold functions","volume":"Vol. 223","author":"Parberry","year":"1986"},{"key":"10.1016\/0022-0000(93)90001-D_BIB23","series-title":"26th Annu. IEEE Found. of Comput. Sci.","first-page":"30","article-title":"On networks of noisy gates","author":"Pippenger","year":"1985"},{"key":"10.1016\/0022-0000(93)90001-D_BIB24","first-page":"798","article-title":"Lower bounds for the monotone complexity of some Boolean functions","volume":"281","author":"Razborov","year":"1985","journal-title":"Dokl. Akad. Nauk."},{"key":"10.1016\/0022-0000(93)90001-D_BIB25","first-page":"598","article-title":"Lower bounds for the size of circuits of bounded depth with basis { \u2228, \u2295 }","volume":"41","author":"Razborov","year":"1987","journal-title":"Mat. Zametki"},{"key":"10.1016\/0022-0000(93)90001-D_BIB35","unstructured":"English translation in: Math. Notes of the Academy of Sciences of the USSR41, 333\u2013338."},{"key":"10.1016\/0022-0000(93)90001-D_BIB26","series-title":"Proceedings, 2nd Structure in Complexity Theory Conf","first-page":"118","article-title":"On threshold circuits and polynomial computation","author":"Reif","year":"1987"},{"key":"10.1016\/0022-0000(93)90001-D_BIB27","volume":"Vol. 1","author":"Rumelhardt","year":"1986"},{"key":"10.1016\/0022-0000(93)90001-D_BIB28","series-title":"Found. in Comput. Theory, 1983","first-page":"151","article-title":"A tight \u03a9(log log n) bound on the time for parallel RAM's to compute nondegenerate Boolean functions","volume":"Vol. 158","author":"Simon","year":"1983"},{"key":"10.1016\/0022-0000(93)90001-D_BIB29","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(83)90051-0","article-title":"A measure in which Boolean negation is exponentially powerful","volume":"17","author":"Skyum","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(93)90001-D_BIB30","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/3149.3158","article-title":"A complexity theory based on Boolean algebra","volume":"32","author":"Skyum","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90001-D_BIB31","series-title":"19th Annu. Proceedings, ACM Sympos. Theory of Comput.","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1016\/0022-0000(93)90001-D_BIB32","series-title":"Ten Lectures on the Probabilistic Method","author":"Spencer","year":"1987"},{"key":"10.1016\/0022-0000(93)90001-D_BIB33","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0020-0190(84)90019-X","article-title":"The critical complexity of graph properties","volume":"18","author":"Tur\u00e1n","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(93)90001-D_BIB34","series-title":"26th Annu IEEE Found. of Comput. Sci.","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390001D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390001D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:57:47Z","timestamp":1550325467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390001D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["002200009390001D"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90001-d","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}