NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem

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]

Abstract

Abstract is missing.