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).
2020
Noga Ron-Zewi
Ronen Shaltiel
Nithin Varma
Keywords:
hard core
Theoretical computer science
Computer science
List decoding
Predicate (grammar)
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]