{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:11:06Z","timestamp":1764645066601,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536509","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"695-704","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["An axiomatic approach to algebrization"],"prefix":"10.1145","author":[{"given":"Russell","family":"Impagliazzo","sequence":"first","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentine","family":"Kabanets","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonina","family":"Kolokolova","sequence":"additional","affiliation":[{"name":"Memorial U. of Newfoundland, St. John's, NF, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374481"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1490270.1490272"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Complexity theory: a modern approach","author":"Arora S.","year":"2009","unstructured":"S. Arora and B. Barak . Complexity theory: a modern approach . 2009 . S. Arora and B. Barak. Complexity theory: a modern approach. 2009."},{"key":"e_1_3_2_1_4_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_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275486"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0220-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/792763.793359"},{"key":"e_1_3_2_1_10_1","first-page":"24","volume-title":"Proc 1964 Intl Congress for Logic, Methodology, and Philosophy of Science","author":"Cobham A.","year":"1964","unstructured":"A. Cobham . The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor , Proc 1964 Intl Congress for Logic, Methodology, and Philosophy of Science , pages 24 -- 30 . 1964 . A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Proc 1964 Intl Congress for Logic, Methodology, and Philosophy of Science, pages 24--30. 1964."},{"key":"e_1_3_2_1_11_1","first-page":"1146","article-title":"On the impossibility of eliminating exhaustive search in computing a function relative to its graph","volume":"14","author":"Dekhtiar M.","year":"1969","unstructured":"M. Dekhtiar . On the impossibility of eliminating exhaustive search in computing a function relative to its graph . Soviet Math. Dokl. , 14 : 1146 -- 1148 , 1969 . M. Dekhtiar. On the impossibility of eliminating exhaustive search in computing a function relative to its graph. Soviet Math. Dokl., 14:1146--1148, 1969.","journal-title":"Soviet Math. Dokl."},{"key":"e_1_3_2_1_12_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 . BEATCS , 52 : 229 -- 244 , February 1994 . L. Fortnow. The role of relativization in complexity theory. BEATCS, 52:229--244, February 1994.","journal-title":"BEATCS"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90199-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80058-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80012-2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80015-6"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90382-5"},{"issue":"3","key":"e_1_3_2_1_21_1","first-page":"191","article-title":"Turing machines that take advice","volume":"28","author":"Karp R.M.","year":"1982","unstructured":"R.M. Karp and R.J. Lipton . Turing machines that take advice . LEns. Math. , 28 ( 3-4 ): 191 -- 209 , 1982 . R.M. Karp and R.J. Lipton. Turing machines that take advice. LEns. Math., 28(3-4):191--209, 1982.","journal-title":"LEns. Math."},{"key":"e_1_3_2_1_22_1","volume-title":"Communication Complexity","author":"Kushilevitz E.","year":"1997","unstructured":"E. Kushilevitz and N. Nisan . Communication Complexity . 1997 . E. Kushilevitz and N. Nisan. Communication Complexity. 1997."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19860321702"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"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","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.07.032"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90040-6"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Bethesda MD USA","acronym":"STOC '09"},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536509","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:51Z","timestamp":1750253931000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":30,"alternative-id":["10.1145\/1536414.1536509","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536509","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}