External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

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
runs on