Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Original languageEnglish
Title of host publication12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
EditorsJames R. Lee
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl -- Leibniz-Zentrum für Informatik
Pages33:1-33:18
Volume185
ISBN (Print)978-3-95977-177-1
DOIs
StatePublished - 2021

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum für Informatik

Cite this