ACM Symposium on Theory of Computing, STOC 2017


Article Details
Title: Time-space hardness of learning sparse parities
Article URLs:
Alternative Article URLs:
Authors: Gillat Kol
  • Princeton University
Ran Raz
  • Princeton University
Avishay Tal
  • Institute for Advanced Study, Princeton
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1412958
DBLP Key: conf/stoc/KolRT17
Author Comments:

Discuss this paper and its artifacts below