Old Web
English
Sign In
Acemap
>
Paper
>
Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists).
Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists).
2021
Noga Ron-Zewi
Ronen Shaltiel
Nithin Varma
Keywords:
Predicate (grammar)
List decoding
Computer science
Theoretical computer science
hard core
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]