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.
Venkata Gandikota, Badih Ghazi, Elena Grigorescu. NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem. Electronic Colloquium on Computational Complexity (ECCC), 23:176, 2016. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott ProblemVenkata Gandikota, Badih Ghazi, Elena Grigorescu. focs 2016: 760-769 [doi] NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott ProblemVenkata Gandikota, Badih Ghazi, Elena Grigorescu. SICOMP, 47(4):1547-1584, 2018. [doi] On the NP-hardness of bounded distance decoding of Reed-Solomon codesVenkata Gandikota, Badih Ghazi, Elena Grigorescu. isit 2015: 2904-2908 [doi]
The following publications are possibly variants of this publication: