{"id":"https://openalex.org/W4289655175","doi":"https://doi.org/10.1109/isit50566.2022.9834647","title":"The Random Number Partitioning Problem: Overlap Gap Property and Algorithmic Barriers","display_name":"The Random Number Partitioning Problem: Overlap Gap Property and Algorithmic Barriers","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655175","doi":"https://doi.org/10.1109/isit50566.2022.9834647"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834647","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5031648070","display_name":"David Gamarnik","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109586","display_name":"Moscow Institute of Thermal Technology","ror":"https://ror.org/021es5e59","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210109586"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"David Gamarnik","raw_affiliation_strings":["MIT"],"affiliations":[{"raw_affiliation_string":"MIT","institution_ids":["https://openalex.org/I4210109586"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029207194","display_name":"Eren C. K\u0131z\u0131lda\u011f","orcid":"https://orcid.org/0000-0003-0411-7161"},"institutions":[{"id":"https://openalex.org/I4210109586","display_name":"Moscow Institute of Thermal Technology","ror":"https://ror.org/021es5e59","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210109586"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Eren C. K\u00edz\u00edlda\u011f","raw_affiliation_strings":["MIT"],"affiliations":[{"raw_affiliation_string":"MIT","institution_ids":["https://openalex.org/I4210109586"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031648070"],"corresponding_institution_ids":["https://openalex.org/I4210109586"],"apc_list":null,"apc_paid":null,"fwci":0.2611,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.37194127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"778","last_page":"783"},"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.9995999932289124,"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.9995999932289124,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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/leverage","display_name":"Leverage (statistics)","score":0.5752606391906738},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5727698802947998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5433055758476257},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5251448154449463},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.49540984630584717},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47666600346565247},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4498915374279022},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.44938981533050537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35441672801971436},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.095608651638031}],"concepts":[{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5752606391906738},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5727698802947998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5433055758476257},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5251448154449463},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.49540984630584717},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47666600346565247},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4498915374279022},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.44938981533050537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35441672801971436},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.095608651638031},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834647","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":65,"referenced_works":["https://openalex.org/W1518984546","https://openalex.org/W1532975866","https://openalex.org/W1566860901","https://openalex.org/W1980276492","https://openalex.org/W2010601719","https://openalex.org/W2011039300","https://openalex.org/W2021697340","https://openalex.org/W2040513782","https://openalex.org/W2042503074","https://openalex.org/W2061086244","https://openalex.org/W2063428816","https://openalex.org/W2079330337","https://openalex.org/W2080024126","https://openalex.org/W2106287110","https://openalex.org/W2115831572","https://openalex.org/W2149178517","https://openalex.org/W2149255574","https://openalex.org/W2151781750","https://openalex.org/W2593370540","https://openalex.org/W2593701861","https://openalex.org/W2607171573","https://openalex.org/W2738325034","https://openalex.org/W2742867136","https://openalex.org/W2886788475","https://openalex.org/W2908282180","https://openalex.org/W2943555824","https://openalex.org/W2962721953","https://openalex.org/W2962765998","https://openalex.org/W2963528781","https://openalex.org/W2963595633","https://openalex.org/W2963697238","https://openalex.org/W2964164735","https://openalex.org/W2965837240","https://openalex.org/W2970770567","https://openalex.org/W2982624330","https://openalex.org/W2984117456","https://openalex.org/W3044069306","https://openalex.org/W3083572948","https://openalex.org/W3098304052","https://openalex.org/W3098407950","https://openalex.org/W3104170093","https://openalex.org/W3106214974","https://openalex.org/W3122217484","https://openalex.org/W3127100532","https://openalex.org/W3133768073","https://openalex.org/W3172297973","https://openalex.org/W3175234097","https://openalex.org/W3202733572","https://openalex.org/W4213200873","https://openalex.org/W4255414226","https://openalex.org/W4287641958","https://openalex.org/W4288278832","https://openalex.org/W4302125393","https://openalex.org/W4313203262","https://openalex.org/W6640761684","https://openalex.org/W6752522928","https://openalex.org/W6753086598","https://openalex.org/W6760013051","https://openalex.org/W6765727170","https://openalex.org/W6766464488","https://openalex.org/W6767786311","https://openalex.org/W6769742081","https://openalex.org/W6770116698","https://openalex.org/W6784552317","https://openalex.org/W6791213423"],"related_works":["https://openalex.org/W4402427056","https://openalex.org/W238609530","https://openalex.org/W4245395944","https://openalex.org/W2143551613","https://openalex.org/W2138823233","https://openalex.org/W1979740464","https://openalex.org/W2143345456","https://openalex.org/W1789991335","https://openalex.org/W3127082728","https://openalex.org/W2067936666"],"abstract_inverted_index":{"We":[0,126],"focus":[1],"on":[2,200],"the":[3,12,35,49,65,90,97,100,103,110,113,129,177,208,215],"problem":[4,16,19],"of":[5,22,52,74,92,99,105,112,124,170,180,182,210,218],"algorithmically":[6],"finding":[7],"a":[8,18,31,118,141,157,201],"near-optimal":[9,142],"solution":[10,143],"for":[11,121,195],"(random)":[13],"number":[14],"partitioning":[15],"(NPP),":[17],"that":[20,133,174],"is":[21,54,173,198,214],"great":[23],"practical":[24],"and":[25,37,108,155],"theoretical":[26],"significance.":[27],"The":[28],"NPP":[29,53,101],"possesses":[30],"striking":[32],"gap":[33,94],"between":[34],"existential":[36],"best":[38,66,209],"algorithmic":[39,223],"guarantee:":[40],"when":[41],"its":[42],"input":[43],"has":[44],"i.i.d.":[45],"standard":[46],"Gaussian":[47],"entries,":[48],"optimal":[50,184],"value":[51,73,145],"$\\Theta":[55],"\\left(":[56,79],"{\\sqrt":[57],"n":[58],"{2^{":[59],"-":[60,77,149,152],"n}}}":[61],"\\right)$":[62],"(w.h.p.);":[63],"whereas":[64],"polynomial-time":[67],"algorithm":[68],"achieves":[69],"an":[70],"exponentially":[71],"worse":[72],"only":[75],"${2^{":[76],"\\Theta":[78],"{{{\\log":[80],"}^2}n}":[81],"\\right)}}$":[82],"(w.h.p.).":[83],"In":[84],"this":[85,93,213],"paper,":[86],"we":[87,175],"inquire":[88],"into":[89],"origin":[91],"by":[95],"studying":[96],"landscape":[98],"through":[102],"lens":[104],"statistical":[106],"physics":[107],"establish":[109,132],"presence":[111],"Overlap":[114],"Gap":[115],"Property":[116],"(OGP),":[117],"topological":[119],"barrier":[120],"large":[122],"classes":[123],"algorithms.":[125],"then":[127],"leverage":[128],"OGP":[130],"to":[131,139,221],"(a)":[134],"sufficiently":[135],"stable":[136,196],"algorithms":[137,197],"fail":[138],"find":[140],"with":[144],"below":[146],"$\\left.":[147],"{{2^{":[148],"\\omega":[150],"(n\\log":[151],"1/5}}n}":[153],"\\right)$;":[154],"(b)":[156],"very":[158],"natural":[159],"Monte":[160],"Carlo":[161],"Markov":[162],"Chain":[163],"dynamics":[164],"mixes":[165],"slowly.":[166],"A":[167],"technical":[168],"innovation":[169],"our":[171,211],"paper":[172],"consider":[176],"overlap":[178],"structure":[179],"m\u2013tuples":[181],"near-":[183],"solutions":[185],"where":[186],"m":[187],"itself":[188],"grows":[189],"in":[190],"n.":[191],"Our":[192],"hardness":[193],"result":[194],"based":[199],"Ramsey-theoretic":[202],"argument":[203],"from":[204],"extremal":[205],"combinatorics.":[206],"To":[207],"knowledge,":[212],"first":[216],"usage":[217],"Ramsey":[219],"Theory":[220],"show":[222],"hardness.":[224]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}