Np-hardness of reed–solomon decoding, and the prouhet–tarry–escott problem

Venkata Gandikota, Badih Ghazi, Elena Grigorescu

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Fingerprint

Dive into the research topics of 'Np-hardness of reed–solomon decoding, and the prouhet–tarry–escott problem'. Together they form a unique fingerprint.

Keyphrases

Mathematics

Computer Science