{"id":"https://openalex.org/W2403633506","doi":"https://doi.org/10.1109/tit.2017.2759281","title":"Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward","display_name":"Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward","publication_year":2017,"publication_date":"2017-10-04","ids":{"openalex":"https://openalex.org/W2403633506","doi":"https://doi.org/10.1109/tit.2017.2759281","mag":"2403633506"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2759281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2759281","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1512.06667","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Saeid Sahraei","orcid":"https://orcid.org/0000-0002-3881-6481"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Saeid Sahraei","raw_affiliation_strings":["School of Computer and Communication Sciences, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":null,"display_name":"Michael Gastpar","orcid":"https://orcid.org/0000-0002-5499-5336"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Michael Gastpar","raw_affiliation_strings":["School of Computer and Communication Sciences, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":1.6589,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84717452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"63","issue":"12","first_page":"7780","last_page":"7792"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8863999843597412,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8863999843597412,"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.0333000011742115,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.024900000542402267,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4747999906539917},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.46070000529289246},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4519999921321869},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4339999854564667},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.35920000076293945},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3149000108242035}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6498000025749207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4805000126361847},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4747999906539917},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.46070000529289246},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4519999921321869},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44929999113082886},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4339999854564667},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C13336665","wikidata":"https://www.wikidata.org/wiki/Q125977","display_name":"Vector space","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29420000314712524},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27959999442100525},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.25189998745918274},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.251800000667572}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.2017.2759281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2759281","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1512.06667","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1512.06667","pdf_url":"https://arxiv.org/pdf/1512.06667","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"pmh:oai:infoscience.epfl.ch:232537","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/232537","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1512.06667","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1512.06667","pdf_url":"https://arxiv.org/pdf/1512.06667","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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/G4962289480","display_name":null,"funder_award_id":"259530-ComCom","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1473048532","https://openalex.org/W1481507124","https://openalex.org/W1583211461","https://openalex.org/W1588051003","https://openalex.org/W1968398095","https://openalex.org/W1968754078","https://openalex.org/W1979160832","https://openalex.org/W2005196269","https://openalex.org/W2035266863","https://openalex.org/W2047051870","https://openalex.org/W2062555860","https://openalex.org/W2065550084","https://openalex.org/W2081227487","https://openalex.org/W2094837187","https://openalex.org/W2101362102","https://openalex.org/W2138293524","https://openalex.org/W2141040012","https://openalex.org/W2144593761","https://openalex.org/W2147355810","https://openalex.org/W2149615851","https://openalex.org/W2153739324","https://openalex.org/W2156787051","https://openalex.org/W2275067185","https://openalex.org/W2465400998","https://openalex.org/W2523640569","https://openalex.org/W2528680055","https://openalex.org/W2963833897","https://openalex.org/W2964101532","https://openalex.org/W4292408570","https://openalex.org/W4300123980","https://openalex.org/W6630413378","https://openalex.org/W6664822550"],"related_works":[],"abstract_inverted_index":{"A":[0],"particular":[1],"instance":[2,27],"of":[3,13,18,53,72],"the":[4,11,16,19,47,51,54,76,79],"shortest":[5],"vector":[6,81],"problem":[7,82],"(SVP)":[8],"appears":[9],"in":[10,31],"context":[12],"compute-and-forward.":[14],"Despite":[15],"NP-hardness":[17],"SVP,":[20],"we":[21],"will":[22,58],"show":[23],"that":[24],"this":[25],"certain":[26],"can":[28,83],"be":[29,84],"solved":[30],"complexity":[32],"order":[33],"O(n\u03c8":[34],"log(n\u03c8)),":[35],"where":[36],"\u03c8":[37],"=":[38],"\u221aP\u2225h\u2225":[39],"<sup":[40],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[42],"+":[43],"1":[44],"depends":[45],"on":[46],"transmission":[48],"power":[49],"and":[50,65,78],"norm":[52],"channel":[55],"vector.":[56],"We":[57],"then":[59],"extend":[60],"our":[61],"results":[62],"to":[63],"integer-forcing":[64],"finally":[66],"introduce":[67],"a":[68,87],"more":[69],"general":[70],"class":[71],"lattices":[73],"for":[74],"which":[75],"SVP":[77],"closest":[80],"approximated":[85],"within":[86],"constant":[88],"factor.":[89]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2016-06-24T00:00:00"}