{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:55Z","timestamp":1750307215836,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["H05068X\/1"],"award-info":[{"award-number":["H05068X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090275","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"496-506","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Marginal hitting sets imply super-polynomial lower bounds for permanent"],"prefix":"10.1145","author":[{"given":"Maurice","family":"Jansen","sequence":"first","affiliation":[{"name":"The University of Edinburgh"}]},{"given":"Rahul","family":"Santhanam","sequence":"additional","affiliation":[{"name":"The University of Edinburgh"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_6"},{"key":"e_1_3_2_1_2_1","volume-title":"Chicago Journal of Theoretical Computer Science","author":"Allender E.","year":"1999","unstructured":"E. Allender . The permanent requires large uniform threshold circuits . Chicago Journal of Theoretical Computer Science , 1999 . article 7. E. Allender. The permanent requires large uniform threshold circuits. Chicago Journal of Theoretical Computer Science, 1999. article 7."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646506.694190"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00183-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0260-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160239"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804674"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00025-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/322358.322373"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796431"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027127.2027204"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0182-6"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. 2nd Symp. on Innovations in Computer Science","author":"Koiran P.","year":"2011","unstructured":"P. Koiran . Shallow circuits with high powered inputs . In Proc. 2nd Symp. on Innovations in Computer Science , 2011 . P. Koiran. Shallow circuits with high powered inputs. In Proc. 2nd Symp. on Innovations in Computer Science, 2011."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0002-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579323"},{"key":"e_1_3_2_1_17_1","first-page":"191","volume-title":"Distributed Computing and Cryptography","author":"Lipton R.","year":"1990","unstructured":"R. Lipton . New directions in testing . In J. Feigenbaum and M. Merritt, editors, Distributed Computing and Cryptography , pages 191 -- 202 . American Mathematical Society , 1990 . R. Lipton. New directions in testing. In J. Feigenbaum and M. Merritt, editors, Distributed Computing and Cryptography, pages 191--202. American Mathematical Society, 1990."},{"key":"e_1_3_2_1_18_1","first-page":"71","volume-title":"LNCS 877","author":"Lipton R.","year":"1994","unstructured":"R. Lipton . Straight-line complexity and integer factorization. Algorithmic Number Theory , LNCS 877 , pages 71 -- 79 , 1994 . R. Lipton. Straight-line complexity and integer factorization. Algorithmic Number Theory, LNCS 877, pages 71--79, 1994."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-95-08105-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220053"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116858"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0187-1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"H. Vollmer. Introduction to Circuit Complexity A Uniform Approach. Springer-Verlag 1999.   H. Vollmer. Introduction to Circuit Complexity A Uniform Approach . Springer-Verlag 1999.","DOI":"10.1007\/978-3-662-03927-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289117"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806723"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.36"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054191000066"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/646670.698972"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts","acronym":"ITCS '12"},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":31,"alternative-id":["10.1145\/2090236.2090275","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090275","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}