IEEE Foundations of Computer Science, FOCS 2016


Article Details
Title: NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem
Article URLs:
Alternative Article URLs:
Authors: Venkata Gandikota
  • Purdue University, Department of Computer Science
Badih Ghazi
  • Massachusetts Institute of Technology, Computer Science and Artiļ¬cial Intelligence Laboratory
Elena Grigorescu
  • Purdue University, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/focs/GandikotaGG16
Author Comments:

Discuss this paper and its artifacts below