{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:00Z","timestamp":1750307040717,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214024","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"495-504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Tight bounds for monotone switching networks via fourier analysis"],"prefix":"10.1145","author":[{"given":"Siu Man","family":"Chan","sequence":"first","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}]},{"given":"Aaron","family":"Potechin","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"volume-title":"Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010","year":"2010","key":"e_1_3_2_2_1_1"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2005.v001a008"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12134"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579196"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970138445X"},{"key":"e_1_3_2_2_6_1","first-page":"3","article-title":"On a method for obtaining lower bounds for the complexity of individual monotone functions","volume":"31","author":"Andreev A. E","year":"1985","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90017-V"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1029"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1778"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/636865.636867"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050017"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275569"},{"key":"e_1_3_2_2_13_1","unstructured":"Bonet M. L. Esteban J. L. Galesi N. and Johannsen J. Exponential separations between restricted resolution and cutting planes proof systems. Electronic Colloquium on Computational Complexity (ECCC) 5 35 (1998).   Bonet M. L. Esteban J. L. Galesi N. and Johannsen J. Exponential separations between restricted resolution and cutting planes proof systems. Electronic Colloquium on Computational Complexity (ECCC) 5 35 (1998)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90027-9"},{"key":"e_1_3_2_2_15_1","first-page":"757","volume-title":"Elsevier and MIT Press","author":"Boppana R. B.","year":"1990"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206054"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80046-2"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2077336.2077337"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-001-8195-x"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9049-y"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90184-W"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795285631"},{"volume-title":"Massachusetts Institute of Technology","year":"1991","author":"Grigni M.","key":"e_1_3_2_2_23_1"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1033"},{"key":"e_1_3_2_2_25_1","first-page":"36","volume-title":"FOCS","author":"Haken A.","year":"1995"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335349"},{"key":"e_1_3_2_2_27_1","first-page":"220","volume-title":"LICS","author":"Impagliazzo R.","year":"1994"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2001120"},{"volume-title":"Ed. Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14--17, 1989","year":"1989","author":"Johnson D. S.","key":"e_1_3_2_2_29_1"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803883"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/791230.792304"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336535"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206317"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403021"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214115"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275541"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90072-A"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794282930"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1083"},{"key":"e_1_3_2_2_41_1","first-page":"4","article-title":"On a boolean function","volume":"7","author":"Neciporuk I","year":"1966","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.58"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050062"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146684"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-002-0007-7"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01157687"},{"key":"e_1_3_2_2_48_1","first-page":"2","article-title":"Lower bounds on the monotone complexity of some boolean functions","volume":"31","author":"Razborov A. A","year":"1985","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73023"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01240265"},{"key":"e_1_3_2_2_51_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-54458-5_49","volume-title":"FCT","author":"Razborov A. A.","year":"1991"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.26"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/791230.792300"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122563"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502099"},{"key":"e_1_3_2_2_57_1","unstructured":"Wehr D. Pebbling and branching programs solving the tree evaluation problem. CoRR abs\/1002.4676 (2010).  Wehr D. Pebbling and branching programs solving the tree evaluation problem. CoRR abs\/1002.4676 (2010)."},{"key":"e_1_3_2_2_58_1","unstructured":"Wehr D. Lower bound for deterministic semantic-incremental branching programs solving GEN. CoRR abs\/1101.2705 (2011).  Wehr D. Lower bound for deterministic semantic-incremental branching programs solving GEN. CoRR abs\/1101.2705 (2011)."},{"key":"e_1_3_2_2_59_1","first-page":"453","article-title":"The fusion method for lower bounds in circuit complexity","author":"Wigderson A","year":"1993","journal-title":"Keszthely (Hungary) ("},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73025"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365685"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214024","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":61,"alternative-id":["10.1145\/2213977.2214024","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214024","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}