{"id":"https://openalex.org/W4376639559","doi":"https://doi.org/10.1145/3564246.3585214","title":"Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \u2113 <i> <sub>p</sub> </i> Norms","display_name":"Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \u2113 <i> <sub>p</sub> </i> Norms","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639559","doi":"https://doi.org/10.1145/3564246.3585214"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585214","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585214","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585214","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585214","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047830282","display_name":"Huck Bennett","orcid":"https://orcid.org/0000-0002-5469-8841"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Huck Bennett","raw_affiliation_strings":["Oregon State University, USA"],"affiliations":[{"raw_affiliation_string":"Oregon State University, USA","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002790246","display_name":"Mahdi Cheraghchi","orcid":"https://orcid.org/0000-0001-8957-0306"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahdi Cheraghchi","raw_affiliation_strings":["University of Michigan, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087635685","display_name":"Jo\u00e3o Ribeiro","orcid":"https://orcid.org/0000-0002-9870-0501"},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Jo\u00e3o Ribeiro","raw_affiliation_strings":["NOVA-LINCS, Portugal / Universidade Nova de Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"NOVA-LINCS, Portugal / Universidade Nova de Lisboa, Portugal","institution_ids":["https://openalex.org/I83558840"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047830282"],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":1.037,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80689806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"553","last_page":"566"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994999766349792,"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T10237","display_name":"Cryptography and Data Security","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9021415710449219},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6953321695327759},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6537588238716125},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5580553412437439},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.504599928855896},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5019075870513916},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4973759949207306},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13224056363105774}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9021415710449219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6953321695327759},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6537588238716125},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5580553412437439},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.504599928855896},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5019075870513916},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4973759949207306},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13224056363105774},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3564246.3585214","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585214","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585214","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:run.unl.pt:10362/158300","is_oa":true,"landing_page_url":"http://hdl.handle.net/10362/158300","pdf_url":"https://run.unl.pt/bitstream/10362/158300/1/Parameterized_Inapproximability_of_the_Minimum_Distance_Problem_over_All_Fields_and_the_Shortest_Vector_Problem_in_All_pNorms.pdf","source":{"id":"https://openalex.org/S4306400678","display_name":"Universidade Nova de Lisboa's Repository (Universidade Nova de Lisboa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83558840","host_organization_name":"Universidade Nova de Lisboa","host_organization_lineage":["https://openalex.org/I83558840"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference object"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585214","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585214","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585214","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2041360570","display_name":null,"funder_award_id":"CCF-2210823, CCF-2228287, CCF-2006455, CCF-2107345, CCF-1814603, CCF-2107347, 1916939","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2174820341","display_name":"CIF: AF: Small: Data Processing Against Synchronization Errors","funder_award_id":"2006455","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2465218775","display_name":null,"funder_award_id":"CCF-2107347","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3272457656","display_name":null,"funder_award_id":"UIDB/","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G3280610492","display_name":"CIF: Small: New Coding Techniques for Synchronization Errors","funder_award_id":"1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3794524892","display_name":null,"funder_award_id":"1916939","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4023552779","display_name":null,"funder_award_id":"NOVA LINCS (UIDB/04516/2020)","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G4611897142","display_name":"Collaborative Research: CIF: Medium: Group testing for Real-Time Polymerase Chain Reactions: From Primer Selection to Amplification Curve Analysis","funder_award_id":"2107345","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4654825957","display_name":null,"funder_award_id":"CCF-2210823","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G521757348","display_name":null,"funder_award_id":"CF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5385755293","display_name":"Collaborative Research: CIF: Medium: Group testing for Real-Time Polymerase Chain Reactions: From Primer Selection to Amplification Curve Analysis","funder_award_id":"2107347","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5430634902","display_name":null,"funder_award_id":"CCF-2006455","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5901906412","display_name":"Collaborative Research: CIF: Medium: Group testing for Real-Time Polymerase Chain Reactions: From Primer Selection to Amplification Curve Analysis","funder_award_id":"2210823","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6348741101","display_name":null,"funder_award_id":"UIDB/04516/2020","funder_id":"https://openalex.org/F4320331406","funder_display_name":"NOVA Laboratory for Computer Science and Informatics"},{"id":"https://openalex.org/G6751408502","display_name":null,"funder_award_id":"CCF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6755165505","display_name":null,"funder_award_id":"award","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6967566380","display_name":null,"funder_award_id":"CCF-2107345","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7061093365","display_name":null,"funder_award_id":"SIEVE","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G769346256","display_name":null,"funder_award_id":"financial support","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G7864912867","display_name":"AF: Small: The Polymorphic Gateway between Structure and Algorithms: Beyond CSP Dichotomy","funder_award_id":"2228287","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G850683389","display_name":null,"funder_award_id":"UIDB/04516/202","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G8725369612","display_name":null,"funder_award_id":"UIDB/04516/2020","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320331406","display_name":"NOVA Laboratory for Computer Science and Informatics","ror":null},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320333450","display_name":"National Energy Technology Laboratory","ror":"https://ror.org/01x26mz03"},{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639559.pdf","grobid_xml":"https://content.openalex.org/works/W4376639559.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W1963871092","https://openalex.org/W1966034053","https://openalex.org/W2012589104","https://openalex.org/W2035929826","https://openalex.org/W2045476715","https://openalex.org/W2052507736","https://openalex.org/W2056492141","https://openalex.org/W2078536889","https://openalex.org/W2083774980","https://openalex.org/W2111319461","https://openalex.org/W2116087731","https://openalex.org/W2122859741","https://openalex.org/W2144593761","https://openalex.org/W2169665116","https://openalex.org/W2282554529","https://openalex.org/W2293438091","https://openalex.org/W2399135883","https://openalex.org/W2461430093","https://openalex.org/W2517177595","https://openalex.org/W2774310513","https://openalex.org/W2893188841","https://openalex.org/W2914414140","https://openalex.org/W2963208902","https://openalex.org/W2963364229","https://openalex.org/W2972062173","https://openalex.org/W2977536198","https://openalex.org/W2983997337","https://openalex.org/W3001868306","https://openalex.org/W3002240277","https://openalex.org/W3036402366","https://openalex.org/W3100371077","https://openalex.org/W3102292552","https://openalex.org/W3144422206","https://openalex.org/W3197644621","https://openalex.org/W3216147140","https://openalex.org/W4292230561","https://openalex.org/W6804434002"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2998616538","https://openalex.org/W2964749573","https://openalex.org/W4288277589","https://openalex.org/W2401679980","https://openalex.org/W4245692971"],"abstract_inverted_index":{"We":[0,31],"prove":[1,33,48],"that":[2,49],"the":[3,19,37,52],"Minimum":[4],"Distance":[5],"Problem":[6,41],"(MDP)":[7],"on":[8,43],"linear":[9],"codes":[10],"over":[11],"any":[12,28,60,64],"fixed":[13,65],"finite":[14],"field":[15],"and":[16,68],"parameterized":[17,38],"by":[18],"input":[20],"distance":[21],"bound":[22],"is":[23,55],"W[1]-hard":[24,56,69],"to":[25,57,70],"approximate":[26,58,71],"within":[27,59,72],"constant":[29,61],"factor.":[30],"also":[32],"analogous":[34],"results":[35],"for":[36,63,77],"Shortest":[39],"Vector":[40],"(SVP)":[42],"integer":[44],"lattices.":[45],"Specifically,":[46],"we":[47],"SVP":[50],"in":[51,85],"\u2113p":[53],"norm":[54],"factor":[62,74],"p":[66],">1":[67],"a":[73],"approaching":[75],"2":[76],"p=1.":[78],"(We":[79],"show":[80],"hardness":[81],"under":[82],"randomized":[83],"reductions":[84],"each":[86],"case.)":[87]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}