{"id":"https://openalex.org/W2085424134","doi":"https://doi.org/10.1109/his.2011.6122146","title":"Metropolis algorithm for solving shortest lattice vector problem (SVP)","display_name":"Metropolis algorithm for solving shortest lattice vector problem (SVP)","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2085424134","doi":"https://doi.org/10.1109/his.2011.6122146","mag":"2085424134"},"language":"en","primary_location":{"id":"doi:10.1109/his.2011.6122146","is_oa":false,"landing_page_url":"https://doi.org/10.1109/his.2011.6122146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040659585","display_name":"K. B. Ajitha Shenoy","orcid":"https://orcid.org/0000-0003-3995-1826"},"institutions":[{"id":"https://openalex.org/I164861460","display_name":"Manipal Academy of Higher Education","ror":"https://ror.org/02xzytt36","country_code":"IN","type":"education","lineage":["https://openalex.org/I164861460"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Shenoy K. B. Ajitha","raw_affiliation_strings":["Department of MCA, Manipal Institute of Technology, Manipal University, Manipal, India"],"affiliations":[{"raw_affiliation_string":"Department of MCA, Manipal Institute of Technology, Manipal University, Manipal, India","institution_ids":["https://openalex.org/I164861460"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102152749","display_name":"Somenath Biswas","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Somenath Biswas","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, INDIA","[Dept. of Computer Sci. & Engg, Indian Institute of Technology, Kanpur, India]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, INDIA","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"[Dept. of Computer Sci. & Engg, Indian Institute of Technology, Kanpur, India]","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090691108","display_name":"Piyush P. Kurur","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Piyush P. Kurur","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, INDIA","[Dept. of Computer Sci. & Engg, Indian Institute of Technology, Kanpur, India]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, INDIA","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"[Dept. of Computer Sci. & Engg, Indian Institute of Technology, Kanpur, India]","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040659585"],"corresponding_institution_ids":["https://openalex.org/I164861460"],"apc_list":null,"apc_paid":null,"fwci":0.8552,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79834099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"442","last_page":"447"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","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/T10237","display_name":"Cryptography and Data Security","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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/T12029","display_name":"DNA and Biological Computing","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lattice-problem","display_name":"Lattice problem","score":0.7766209840774536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5773773789405823},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5249291062355042},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5229966640472412},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4984428882598877},{"id":"https://openalex.org/keywords/lattice","display_name":"Lattice (music)","score":0.4379728138446808},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.43316102027893066},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41147804260253906},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4113618731498718},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37910380959510803}],"concepts":[{"id":"https://openalex.org/C168482242","wikidata":"https://www.wikidata.org/wiki/Q6497128","display_name":"Lattice problem","level":3,"score":0.7766209840774536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5773773789405823},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5249291062355042},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5229966640472412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4984428882598877},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.4379728138446808},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.43316102027893066},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41147804260253906},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4113618731498718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37910380959510803},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/his.2011.6122146","is_oa":false,"landing_page_url":"https://doi.org/10.1109/his.2011.6122146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W57720693","https://openalex.org/W1595409123","https://openalex.org/W2067935912","https://openalex.org/W2078376369","https://openalex.org/W2102391224","https://openalex.org/W2141040012","https://openalex.org/W2141299465","https://openalex.org/W2142048307","https://openalex.org/W2144593761","https://openalex.org/W2899702797","https://openalex.org/W2950292814","https://openalex.org/W3217775779","https://openalex.org/W4255339468","https://openalex.org/W6602383322"],"related_works":["https://openalex.org/W2794559785","https://openalex.org/W2949749387","https://openalex.org/W2405098260","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337","https://openalex.org/W3037620928"],"abstract_inverted_index":{"In":[0,93],"this":[1,94,146],"paper":[2],"we":[3,96,107,132],"study":[4],"the":[5,8,16,37,60,72,91,104,112,124,127,166,176],"suitability":[6],"of":[7,111,126,154,172],"Metropolis":[9,113,167,173],"Algorithm":[10],"and":[11,131,160,169],"its":[12],"generalization":[13,171],"for":[14,59,103,109,150,158,175],"solving":[15],"shortest":[17],"lattice":[18],"vector":[19],"problem":[20,61,105],"(SVP).":[21],"SVP":[22,40],"has":[23,138],"numerous":[24],"applications":[25],"spanning":[26],"from":[27,90],"robotics":[28],"to":[29],"computational":[30],"number":[31],"theory,":[32],"viz.,":[33],"polynomial":[34,56,65,78],"factorization.":[35],"At":[36],"same":[38],"time,":[39],"is":[41,49,52,71],"a":[42,77,118],"notoriously":[43],"hard":[44],"problem.":[45],"Not":[46],"only":[47,139],"it":[48],"NP-hard,":[50],"there":[51],"not":[53],"even":[54],"any":[55],"approximation":[57],"known":[58],"that":[62,134],"runs":[63],"in":[64,183],"time.":[66],"What":[67],"one":[68],"normally":[69],"uses":[70],"LLL":[73,189],"algorithm":[74,168,174],"which,":[75],"although":[76],"time":[79],"algorithm,":[80],"may":[81],"give":[82],"solutions":[83],"which":[84,106,122],"are":[85,180],"an":[86,99],"exponential":[87],"factor":[88],"away":[89],"optimum.":[92],"paper,":[95],"have":[97,116,164],"defined":[98,117],"appropriate":[100],"search":[101,136,147],"space":[102,128,148],"use":[108,145],"implementation":[110],"algorithm.":[114,190],"We":[115,143,163],"suitable":[119],"neighbourhood":[120],"structure":[121],"makes":[123],"diameter":[125],"polynomially":[129,140],"bounded,":[130],"ensure":[133],"each":[135],"point":[137],"many":[141],"neighbours.":[142],"can":[144],"formulation":[149],"some":[151],"other":[152],"classes":[153],"evolutionary":[155],"algorithms,":[156],"e.g.,":[157],"genetic":[159],"go-with-the-winner":[161],"algorithms.":[162],"implemented":[165],"Hasting's":[170],"SVP.":[177],"Our":[178],"results":[179],"quite":[181],"encouraging":[182],"all":[184],"instances":[185],"when":[186],"compared":[187],"with":[188]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}