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]
@article{GandikotaGG16,
title = {NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem},
author = {Venkata Gandikota and Badih Ghazi and Elena Grigorescu},
year = {2016},
url = {http://eccc.hpi-web.de/report/2016/176},
researchr = {https://researchr.org/publication/GandikotaGG16},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {23},
pages = {176},
}