{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:00:51Z","timestamp":1778292051941,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"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":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374481","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"731-740","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Algebrization"],"prefix":"10.1145","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.32"},{"key":"e_1_3_2_1_2_1","volume-title":"Manuscript","author":"Arora S.","year":"1992","unstructured":"S. Arora , R. Impagliazzo , and U. Vazirani . Relativizing versus nonrelativizing techniques: the role of local checkability . Manuscript , 1992 . S. Arora, R. Impagliazzo, and U. Vazirani. Relativizing versus nonrelativizing techniques: the role of local checkability. Manuscript, 1992."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/792763.793359"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.18"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"e_1_3_2_1_9_1","first-page":"229","article-title":"The role of relativization in complexity theory","volume":"52","author":"Fortnow L.","year":"1994","unstructured":"L. Fortnow . The role of relativization in complexity theory . Bulletin of the EATCS , 52 : 229 -- 244 , February 1994 . L. Fortnow. The role of relativization in complexity theory. Bulletin of the EATCS, 52:229--244, February 1994.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_11_1","first-page":"144","article-title":"Relativization: a revisionistic perspective","volume":"47","author":"Hartmanis J.","year":"1992","unstructured":"J. Hartmanis , R. Chang , S. Chari , D. Ranjan , and P. Rohatgi . Relativization: a revisionistic perspective . Bulletin of the EATCS , 47 : 144 -- 153 , 1992 . J. Hartmanis, R. Chang, S. Chari, D. Ranjan, and P. Rohatgi. Relativization: a revisionistic perspective. Bulletin of the EATCS, 47:144--153, 1992.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322015"},{"key":"e_1_3_2_1_14_1","volume-title":"The black-box query complexity of polynomial summation. ECCC TR07-125","author":"Juma A.","year":"2007","unstructured":"A. Juma , V. Kabanets , C. Rackoff , and A. Shpilka . The black-box query complexity of polynomial summation. ECCC TR07-125 , 2007 . A. Juma, V. Kabanets, C. Rackoff, and A. Shpilka. The black-box query complexity of polynomial summation. ECCC TR07-125, 2007."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90382-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214415"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700389652"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301343"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009378.1009562"},{"issue":"4","key":"e_1_3_2_1_22_1","first-page":"598","article-title":"Lower bounds for the size of circuits of bounded depth with basis \u0142eft & ,\u00f8\u00f8 + ->","volume":"41","author":"Razborov A. A.","year":"1987","unstructured":"A. A. Razborov . Lower bounds for the size of circuits of bounded depth with basis \u0142eft & ,\u00f8\u00f8 + -> . Mathematicheskie Zametki , 41 ( 4 ): 598 -- 607 , 1987 . A. A. Razborov. Lower bounds for the size of circuits of bounded depth with basis \u0142eft & ,\u00f8\u00f8 + ->. Mathematicheskie Zametki, 41(4):598--607, 1987.","journal-title":"Mathematicheskie Zametki"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1070\/IM2003v067n01ABEH000422"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250832"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220053"},{"key":"e_1_3_2_1_29_1","volume-title":"A note on the circuit complexity of PP. ECCC TR04-056","author":"Vinodchandran N. V.","year":"2004","unstructured":"N. V. Vinodchandran . A note on the circuit complexity of PP. ECCC TR04-056 , 2004 . N. V. Vinodchandran. A note on the circuit complexity of PP. ECCC TR04-056, 2004."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90040-6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374481","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:50Z","timestamp":1750255070000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374481"}},"subtitle":["a new barrier in complexity theory"],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":31,"alternative-id":["10.1145\/1374376.1374481","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374481","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}