%0 Conference Paper %1 conf/innovations/Ron-ZewiSV21 %A Ron-Zewi, Noga %A Shaltiel, Ronen %A Varma, Nithin %B ITCS %D 2021 %E Lee, James R. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 33:1-33:18 %T Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). %U http://dblp.uni-trier.de/db/conf/innovations/innovations2021.html#Ron-ZewiSV21 %V 185 %@ 978-3-95977-177-1

@inproceedings{conf/innovations/Ron-ZewiSV21, added-at = {2024-06-07T00:00:00.000+0200}, author = {Ron-Zewi, Noga and Shaltiel, Ronen and Varma, Nithin}, biburl = {https://www.bibsonomy.org/bibtex/255908559e4c98693880d087e81f53957/dblp}, booktitle = {ITCS}, crossref = {conf/innovations/2021}, editor = {Lee, James R.}, ee = {https://doi.org/10.4230/LIPIcs.ITCS.2021.33}, interhash = {5ea597041f6a8e5a98e958288b40ea76}, intrahash = {55908559e4c98693880d087e81f53957}, isbn = {978-3-95977-177-1}, keywords = {dblp}, pages = {33:1-33:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-06-10T07:20:27.000+0200}, title = {Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists).}, url = {http://dblp.uni-trier.de/db/conf/innovations/innovations2021.html#Ron-ZewiSV21}, volume = 185, year = 2021 }