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. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. pages 760-769, IEEE, 2016. [doi]

Abstract

Abstract is missing.