乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T21:57:08Z","timestamp":1730325428656,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520051","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T11:29:32Z","timestamp":1654860572000},"page":"1575-1583","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Robustness of average-case meta-complexity via pseudorandomness"],"prefix":"10.1145","author":[{"given":"Rahul","family":"Ilango","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Hanlin","family":"Ren","sequence":"additional","affiliation":[{"name":"Oxford University, UK"}]},{"given":"Rahul","family":"Santhanam","sequence":"additional","affiliation":[{"name":"Oxford University, UK"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45294-X_1"},{"key":"e_1_3_2_1_2_1","volume-title":"LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings (Lecture Notes in Computer Science","volume":"16","author":"Allender Eric","year":"2020","unstructured":"Eric Allender . 2020 . The New Complexity Landscape Around Circuit Minimization. In Language and Automata Theory and Applications - 14th International Conference , LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings (Lecture Notes in Computer Science , Vol. 12038). Springer, 3\u2013 16 . Eric Allender. 2020. The New Complexity Landscape Around Circuit Minimization. In Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings (Lecture Notes in Computer Science, Vol. 12038). Springer, 3\u201316."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/050628994"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2021.7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/314613.315014"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.12"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/120884857"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-015-0121-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446950"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_24"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2016.10"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00077"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384283"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2141938.2141941"},{"key":"e_1_3_2_1_16_1","volume-title":"Candidate One-Way Functions Based on Expander Graphs. Electron. Colloquium Comput. Complex., 7, 90","author":"Goldreich Oded","year":"2000","unstructured":"Oded Goldreich . 2000. Candidate One-Way Functions Based on Expander Graphs. Electron. Colloquium Comput. Complex., 7, 90 ( 2000 ), http:\/\/eccc.hpi-web.de\/eccc-reports\/2000\/TR00-090\/index.html Oded Goldreich. 2000. Candidate One-Way Functions Based on Expander Graphs. Electron. Colloquium Comput. Complex., 7, 90 (2000), http:\/\/eccc.hpi-web.de\/eccc-reports\/2000\/TR00-090\/index.html"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/100814421"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00032"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00014"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451065"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2017.7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.34"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00047"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2020.22"},{"key":"e_1_3_2_1_27_1","unstructured":"Rahul Ilango Hanlin Ren and Rahul Santhanam. 2021. Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity. Electron. Colloquium Comput. Complex. 82. https:\/\/eccc.weizmann.ac.il\/report\/2021\/082 Rahul Ilango Hanlin Ren and Rahul Santhanam. 2021. Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity. Electron. Colloquium Comput. Complex. 82. https:\/\/eccc.weizmann.ac.il\/report\/2021\/082"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1995.514853"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89604"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63483"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030402"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335314"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00103-K"},{"key":"e_1_3_2_1_34_1","first-page":"30","article-title":"Laws of information conservation (nongrowth) and aspects of the foundation of probability theory","volume":"10","author":"Levin Leonid A.","year":"1974","unstructured":"Leonid A. Levin . 1974 . Laws of information conservation (nongrowth) and aspects of the foundation of probability theory . Problemy Peredachi Informatsii , 10 , 3 (1974), 30 \u2013 35 . Leonid A. Levin. 1974. Laws of information conservation (nongrowth) and aspects of the foundation of probability theory. Problemy Peredachi Informatsii, 10, 3 (1974), 30\u201335.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80060-1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579323"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1023\/A%3A1023634616182"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"e_1_3_2_1_39_1","unstructured":"Yanyi Liu and Rafael Pass. 2021. A Note on One-way Functions and Sparse Languages. Electron. Colloquium Comput. Complex. 92. Yanyi Liu and Rafael Pass. 2021. A Note on One-way Functions and Sparse Languages. Electron. Colloquium Comput. Complex. 92."},{"key":"e_1_3_2_1_40_1","first-page":"59","article-title":"On One-way Functions from -Complete Problems","volume":"28","author":"Liu Yanyi","year":"2021","unstructured":"Yanyi Liu and Rafael Pass . 2021 . On One-way Functions from -Complete Problems . Electron. Colloquium Comput. Complex. , 28 (2021), 59 . https:\/\/eccc.weizmann.ac.il\/report\/2021\/059 Yanyi Liu and Rafael Pass. 2021. On One-way Functions from -Complete Problems. Electron. Colloquium Comput. Complex., 28 (2021), 59. https:\/\/eccc.weizmann.ac.il\/report\/2021\/059","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_2"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.94"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316396"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2017.v013a004"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.32"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2019.27"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2017.18"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00016"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1993.253489"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00080"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2021.35"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.68"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1984.10036"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447207"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T12:20:56Z","timestamp":1673439656000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":56,"alternative-id":["10.1145\/3519935.3520051","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520051","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}