External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)

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). Electronic Colloquium on Computational Complexity (ECCC), 27:133, 2020. [doi]

Abstract

Abstract is missing.

runs on