Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem.
Venkata Gandikota
,
Badih Ghazi
,
Elena Grigorescu
Venue
A*
FOCS
Year
2016
Proceedings
FOCS
DBLP record
conf/focs/GandikotaGG16 ↗
Browse the full
FOCS paper archive
.