{"id":"https://openalex.org/W7128640529","doi":"https://doi.org/10.1109/focs63196.2025.00029","title":"Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)","display_name":"Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128640529","doi":"https://doi.org/10.1109/focs63196.2025.00029"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00029","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5062230321","display_name":"Lasse Wulf","orcid":"https://orcid.org/0000-0001-7139-4092"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Lasse Wulf","raw_affiliation_strings":["IT University of Copenhagen,Copenhagen,Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen,Copenhagen,Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062230321"],"corresponding_institution_ids":["https://openalex.org/I83467386"],"apc_list":null,"apc_paid":null,"fwci":5.0508,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.96591684,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"531","last_page":"551"},"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.743399977684021,"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.743399977684021,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.061400000005960464,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.03610000014305115,"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/polytope","display_name":"Polytope","score":0.8131999969482422},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6668000221252441},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.5436999797821045},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5098000168800354},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.4756999909877777},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.4494999945163727},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.33719998598098755},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3337000012397766}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8195000290870667},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8131999969482422},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7821000218391418},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6668000221252441},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.5436999797821045},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5098000168800354},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.4756999909877777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45719999074935913},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.33719998598098755},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.319599986076355},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.31040000915527344},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30570000410079956},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.27250000834465027},{"id":"https://openalex.org/C110202963","wikidata":"https://www.wikidata.org/wiki/Q1783542","display_name":"Convex geometry","level":5,"score":0.26969999074935913},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00029","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6109589338302612}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"diameter":[1,33,158,211,232,276],"of":[2,19,30,34,74,103,159,199,233,274],"a":[3,6,12,35,90,101,110,243,250],"polytope":[4,37,122,144,164,202,238],"is":[5,38,68,125,165,173,203,212,258],"fundamental":[7],"geometric":[8],"parameter":[9],"that":[10,52,114,155,225],"plays":[11],"crucial":[13],"role":[14],"in":[15,42,109,177,191],"understanding":[16],"the":[17,20,27,32,50,64,71,75,81,117,123,138,146,157,160,169,196,200,210,215,230,234,259,265,275,278],"efficiency":[18],"simplex":[21],"method.":[22],"Despite":[23],"its":[24],"central":[25],"nature,":[26],"computational":[28],"complexity":[29],"computing":[31,156],"given":[36,201],"poorly":[39],"understood.":[40],"Already":[41],"1994,":[43],"Frieze":[44,93,182],"and":[45,61,94,131,145,183,255,268],"Teng":[46,95],"[Comp.":[47],"Compl.]":[48],"recognized":[49],"possibility":[51],"this":[53,135,150,179],"task":[54],"could":[55,86],"potentially":[56],"be":[57,87,240],"harder":[58],"than":[59,246],"NP-hard,":[60],"asked":[62],"whether":[63],"corresponding":[65,170],"decision":[66,171],"problem":[67,124,172],"complete":[69],"for":[70,100,116,226,264],"second":[72,220],"level":[73],"polynomial":[76],"hierarchy,":[77],"i.e.":[78],"$\\Pi_{2}^{p}$-complete.":[79],"In":[80,89,149],"following":[82],"years,":[83],"partial":[84],"results":[85,190],"obtained.":[88],"cornerstone":[91],"result,":[92,222],"themselves":[96],"proved":[97,113],"weak":[98],"NP-hardness":[99],"family":[102],"custom":[104],"defined":[105],"polytopes.":[106],"Sanit\u00e0":[107,270],"[FOCS18]":[108],"break-through":[111],"result":[112,136,263,273],"already":[115],"much":[118],"simpler":[119,140],"fractional":[120],"matching":[121,143,163,237],"strongly":[126],"NP-hard.":[127],"Very":[128],"recently,":[129],"Steiner":[130],"N\u00f6bel":[132,254],"[SODA25]":[133],"generalized":[134],"to":[137,277],"even":[139,194],"bipartite":[141,161,235],"perfect":[142,162,236],"circuit":[147,216,266],"diameter.":[148,217],"paper,":[151],"we":[152,223],"finally":[153],"show":[154],"$\\Pi_{2}^{p}$":[166],"hard.":[167],"Since":[168],"also":[174,207],"trivially":[175],"contained":[176],"$\\Pi_{2}^{p}$,":[178],"decidedly":[180],"answers":[181,249],"Teng\u2019s":[184],"30":[185],"year":[186],"old":[187],"question.":[188],"Our":[189],"particular":[192],"hold":[193,208],"when":[195,209],"constraint":[197],"matrix":[198],"totally":[204,279],"unimodular.":[205],"They":[206],"replaced":[213],"by":[214,242,253],"As":[218],"our":[219],"main":[221],"prove":[224],"some":[227],"$\\varepsilon\\gt":[228],"0$":[229],"(circuit)":[231],"cannot":[239],"approximated":[241],"factor":[244],"better":[245],"($1+\\varepsilon$).":[247],"This":[248],"recent":[251],"question":[252],"Steiner.":[256],"It":[257],"first":[260],"known":[261],"inapproximability":[262,272],"diameter,":[267],"extends":[269],"\u2019s":[271],"unimodular":[280],"case.":[281]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-02-12T00:00:00"}