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]

Authors

Venkata Gandikota

This author has not been identified. Look up 'Venkata Gandikota' in Google

Badih Ghazi

This author has not been identified. Look up 'Badih Ghazi' in Google

Elena Grigorescu

This author has not been identified. Look up 'Elena Grigorescu' in Google