The hardness of range avoidance for randomized algorithms implies Minicrypt. Chung, E., Golovnev, A., Li, Z., Obremski, M., Saraogi, S., & Stephens-Davidowitz, N. 2023.
![The hardness of range avoidance for randomized algorithms implies Minicrypt [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex 1 download
Paper bibtex 1 download @unpublished{CGLOSS23,
title = {The hardness of range avoidance for randomized algorithms implies Minicrypt},
author = {Eldon Chung and Alexander Golovnev and Zeyong Li and Maciej Obremski and Sidhant Saraogi and Noah {Stephens-Davidowitz}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/193},
}Downloads: 1
{"_id":"egjGwsRFiWWxHixMZ","bibbaseid":"chung-golovnev-li-obremski-saraogi-stephensdavidowitz-thehardnessofrangeavoidanceforrandomizedalgorithmsimpliesminicrypt-2023","author_short":["Chung, E.","Golovnev, A.","Li, Z.","Obremski, M.","Saraogi, S.","Stephens-Davidowitz, N."],"bibdata":{"bibtype":"unpublished","type":"unpublished","title":"The hardness of range avoidance for randomized algorithms implies Minicrypt","author":[{"firstnames":["Eldon"],"propositions":[],"lastnames":["Chung"],"suffixes":[]},{"firstnames":["Alexander"],"propositions":[],"lastnames":["Golovnev"],"suffixes":[]},{"firstnames":["Zeyong"],"propositions":[],"lastnames":["Li"],"suffixes":[]},{"firstnames":["Maciej"],"propositions":[],"lastnames":["Obremski"],"suffixes":[]},{"firstnames":["Sidhant"],"propositions":[],"lastnames":["Saraogi"],"suffixes":[]},{"firstnames":["Noah"],"propositions":[],"lastnames":["Stephens-Davidowitz"],"suffixes":[]}],"year":"2023","url":"https://eccc.weizmann.ac.il/report/2023/193","bibtex":"@unpublished{CGLOSS23,\n title = {The hardness of range avoidance for randomized algorithms implies Minicrypt},\n author = {Eldon Chung and Alexander Golovnev and Zeyong Li and Maciej Obremski and Sidhant Saraogi and Noah {Stephens-Davidowitz}},\n year = {2023},\n url = {https://eccc.weizmann.ac.il/report/2023/193},\n}\n\n","author_short":["Chung, E.","Golovnev, A.","Li, Z.","Obremski, M.","Saraogi, S.","Stephens-Davidowitz, N."],"key":"CGLOSS23","id":"CGLOSS23","bibbaseid":"chung-golovnev-li-obremski-saraogi-stephensdavidowitz-thehardnessofrangeavoidanceforrandomizedalgorithmsimpliesminicrypt-2023","role":"author","urls":{"Paper":"https://eccc.weizmann.ac.il/report/2023/193"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"unpublished","biburl":"https://dl.dropbox.com/s/26018h26wgh5c2o/bibbase.bib","dataSources":["j49aoDnSSLjzndmof"],"keywords":[],"search_terms":["hardness","range","avoidance","randomized","algorithms","implies","minicrypt","chung","golovnev","li","obremski","saraogi","stephens-davidowitz"],"title":"The hardness of range avoidance for randomized algorithms implies Minicrypt","year":2023,"downloads":1}