Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma. Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). In James R. Lee, editor, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference. Volume 185 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{Ron-ZewiSV21,
title = {Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists)},
author = {Noga Ron-Zewi and Ronen Shaltiel and Nithin Varma},
year = {2021},
doi = {10.4230/LIPIcs.ITCS.2021.33},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.33},
researchr = {https://researchr.org/publication/Ron-ZewiSV21},
cites = {0},
citedby = {0},
booktitle = {12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference},
editor = {James R. Lee},
volume = {185},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-177-1},
}