NP-hardness of Reed-Solomon decoding and the Prouhet-Tarry-Escott problem

DOI10.1109/FOCS.2016.86MaRDI QIDQ6946420zbMATH OpenFDO

Authors Elena Grigorescu, Badih Ghazi, Venkata Gandikota

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.86

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

This page was built for publication: NP-hardness of Reed-Solomon decoding and the Prouhet-Tarry-Escott problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946420)