{"id":"https://openalex.org/W2572537388","doi":"https://doi.org/10.1137/16m110349x","title":"NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem","display_name":"NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2572537388","doi":"https://doi.org/10.1137/16m110349x","mag":"2572537388"},"language":"en","primary_location":{"id":"doi:10.1137/16m110349x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m110349x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1611.03069","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089321118","display_name":"Venkata Gandikota","orcid":"https://orcid.org/0000-0003-2381-7788"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkata Gandikota","raw_affiliation_strings":["PURDUE UNIVERSITY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PURDUE UNIVERSITY","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016244525","display_name":"Badih Ghazi","orcid":"https://orcid.org/0000-0001-8254-3268"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Badih Ghazi","raw_affiliation_strings":["Massachusetts Institute Of Technology#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute Of Technology#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090091569","display_name":"Elena Grigorescu","orcid":"https://orcid.org/0000-0001-9673-4313"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elena Grigorescu","raw_affiliation_strings":["PURDUE UNIVERSITY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PURDUE UNIVERSITY","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00754257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"47","issue":"4","first_page":"1547","last_page":"1584"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6561805605888367},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4067133069038391},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2372157871723175}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6561805605888367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4067133069038391},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2372157871723175}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/16m110349x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m110349x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1611.03069","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1611.03069","pdf_url":"https://arxiv.org/pdf/1611.03069","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2950536119","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1611.03069.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1611.03069","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1611.03069","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:2572537388","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc23.html#GandikotaGG16","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1611.03069","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1611.03069","pdf_url":"https://arxiv.org/pdf/1611.03069","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1513559549","display_name":null,"funder_award_id":"CCF0-939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1695220478","display_name":null,"funder_award_id":"CCF-1420692","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G175220530","display_name":null,"funder_award_id":"CCF-1217423","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4286844903","display_name":"AF: Small: New directions in the design of local computation algorithms","funder_award_id":"1420692","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4565220168","display_name":null,"funder_award_id":"CCF 0939370,CCF-1217423,CCF-1420956,CCF-1420692,CCF-1217423","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6244900323","display_name":"Emerging Frontiers of Science of Information","funder_award_id":"0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G697731757","display_name":"EAGER:   Complexity of Computation on Codes and Lattices","funder_award_id":"1649515","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G717462885","display_name":"AF: Small: Local Computation Algorithms","funder_award_id":"1217423","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8026948129","display_name":"AF: Small: Algebraic Tools for Coding, Complexity and Combinatorics","funder_award_id":"1420956","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G80611279","display_name":null,"funder_award_id":"CCF-1649515","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"},{"id":"https://openalex.org/F4320309667","display_name":"Purdue Research Foundation","ror":"https://ror.org/007n03h88"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2572537388.pdf","grobid_xml":"https://content.openalex.org/works/W2572537388.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1966508782","https://openalex.org/W1999032440","https://openalex.org/W2008455956","https://openalex.org/W2017008844","https://openalex.org/W2019009209","https://openalex.org/W2032431003","https://openalex.org/W2046947513","https://openalex.org/W2060296335","https://openalex.org/W2083175934","https://openalex.org/W2089272132","https://openalex.org/W2100852839","https://openalex.org/W2103236224","https://openalex.org/W2110614437","https://openalex.org/W2126459307","https://openalex.org/W2144253890","https://openalex.org/W2146078064","https://openalex.org/W2157915592","https://openalex.org/W2169665116","https://openalex.org/W2174870427","https://openalex.org/W3014312596","https://openalex.org/W3144422206"],"related_works":["https://openalex.org/W2887573924","https://openalex.org/W2128068164","https://openalex.org/W2518167028","https://openalex.org/W1548705449","https://openalex.org/W2155791406","https://openalex.org/W2345387074","https://openalex.org/W2543390563","https://openalex.org/W138212756","https://openalex.org/W1966214710","https://openalex.org/W2031949565","https://openalex.org/W1975709480","https://openalex.org/W2541661803","https://openalex.org/W973617472","https://openalex.org/W2128163862","https://openalex.org/W2994481912","https://openalex.org/W1598744879","https://openalex.org/W3005753757","https://openalex.org/W2754662222","https://openalex.org/W1670707924","https://openalex.org/W2754922726"],"abstract_inverted_index":{"Establishing":[0],"the":[1,37,42,49,57,62,72,116,140,217,223,256,277,284],"complexity":[2],"of":[3,77,85,139,184,219,222,246],"bounded":[4,141],"distance":[5,142],"decoding":[6,69,75,143],"for":[7,66,82,123,145],"Reed--Solomon":[8,83,146],"codes":[9,84,147],"is":[10,34,46,53,95,118,148,162,194,203],"a":[11,150,169,181,204,220,238,252,268],"fundamental":[12],"open":[13,240],"problem":[14,33,117,144,227,259,279],"in":[15,260,271,283],"coding":[16],"theory,":[17,262],"explicitly":[18],"asked":[19],"by":[20,36],"Guruswami":[21,78],"and":[22,48,79,88,242],"Vardy":[23],"[IEEE":[24],"Trans.":[25],"Inform.":[26],"Theory,":[27],"51":[28],"(2005),":[29],"pp.":[30],"2249--2256].":[31],"The":[32],"motivated":[35],"large":[38],"current":[39],"gap":[40],"between":[41],"regime":[43,50],"when":[44,51],"it":[45,52,94,161,193],"NP-hard":[47,96,119,163,195],"efficiently":[54],"solvable":[55],"(i.e.,":[56],"Johnson":[58],"radius).":[59],"We":[60,249,275],"show":[61,92,114,159],"first":[63],"NP-hardness":[64,218],"results":[65,158,214],"asymptotically":[67],"smaller":[68],"radii":[70],"than":[71,100],"maximum":[73],"likelihood":[74],"radius":[76],"Vardy.":[80],"Specifically,":[81],"length":[86],"$N$":[87],"dimension":[89],"$K=\\Theta(N)$,":[90],"we":[91,113],"that":[93,115,160],"to":[97,164,199,228,266],"decode":[98],"more":[99],"$":[101],"N-K-":[102,128],"c\\frac{\\log":[103,176],"N}{\\log\\log":[104,177],"N}$":[105,178],"errors":[106],"(with":[107,130],"$c>0$":[108,131],"an":[109,124,132],"absolute":[110,133],"constant).":[111,134],"Moreover,":[112],"under":[120,196],"quasi-polynomial-time":[121,197],"reductions":[122,198],"error":[125],"amount":[126],"$>":[127],"c\\log{N}$":[129],"An":[135],"alternative":[136],"natural":[137],"reformulation":[138],"as":[149],"polynomial":[151,172,207],"reconstruction":[152],"problem.":[153],"In":[154],"this":[155],"view,":[156],"our":[157,273],"decide":[165,200],"whether":[166,201],"there":[167,202],"exists":[168],"degree":[170,205],"$K$":[171,206],"passing":[173,208],"through":[174,209],"$K+":[175],"points":[179,185],"from":[180,216],"given":[182],"set":[183],"$(a_1,":[186],"b_1),":[187],"(a_2,":[188],"b_2)\\ldots,":[189],"(a_N,":[190],"b_N)$.":[191],"Furthermore,":[192],"$K+c\\log{N}$":[210],"many":[211],"points.":[212],"These":[213],"follow":[215],"generalization":[221],"classical":[224],"subset":[225,233],"sum":[226],"higher":[229],"moments,":[230],"called":[231],"moments":[232],"sum,":[234],"which":[235,243,263],"has":[236],"been":[237],"known":[239],"problem,":[241],"may":[244],"be":[245],"independent":[247],"interest.":[248],"further":[250,281],"reveal":[251],"strong":[253],"connection":[254],"with":[255],"well-studied":[257],"Prouhet--Tarry--Escott":[258,278],"number":[261],"turns":[264],"out":[265],"capture":[267],"main":[269],"barrier":[270],"extending":[272],"techniques.":[274],"believe":[276],"deserves":[280],"study":[282],"theoretical":[285],"computer":[286],"science":[287],"community.":[288]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}