• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Venkata GandikotaBadih GhaziElena Grigorescu
Published in: SIAM J. Comput. (2018)
Keyphrases