{"id":"https://openalex.org/W4313421121","doi":"https://doi.org/10.1007/s00453-022-01086-9","title":"On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs","display_name":"On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs","publication_year":2022,"publication_date":"2022-12-28","ids":{"openalex":"https://openalex.org/W4313421121","doi":"https://doi.org/10.1007/s00453-022-01086-9"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-01086-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01086-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01086-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01086-9.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041262148","display_name":"Alberto Del Pia","orcid":"https://orcid.org/0000-0001-8428-3914"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]},{"id":"https://openalex.org/I2802999273","display_name":"Wisconsin Institutes for Discovery","ror":"https://ror.org/05gbven85","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I2802999273"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alberto Del Pia","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Wisconsin-Madison, 1513 University Avenue, Madison, WI, 53706, USA","Wisconsin Institute for Discovery, University of Wisconsin-Madison, 330 North Orchard Street, Madison, WI, 53715, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Wisconsin-Madison, 1513 University Avenue, Madison, WI, 53706, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Wisconsin Institute for Discovery, University of Wisconsin-Madison, 330 North Orchard Street, Madison, WI, 53715, USA","institution_ids":["https://openalex.org/I2802999273","https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015547417","display_name":"Silvia Di Gregorio","orcid":"https://orcid.org/0000-0002-0071-5669"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Silvia Di Gregorio","raw_affiliation_strings":["Faculty of Computer Science, TU Dresden, N\u00f6thnitzer Stra\u00dfe\u00a046, 01187, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, TU Dresden, N\u00f6thnitzer Stra\u00dfe\u00a046, 01187, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015547417"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.5843,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70912246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"85","issue":"8","first_page":"2189","last_page":"2213"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9944999814033508,"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/hypergraph","display_name":"Hypergraph","score":0.5770387649536133},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.568522036075592},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5277039408683777},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4986698627471924},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4839940071105957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4365261197090149},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4231206774711609},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40349364280700684},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3798469007015228}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5770387649536133},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.568522036075592},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5277039408683777},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4986698627471924},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4839940071105957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4365261197090149},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4231206774711609},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40349364280700684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3798469007015228},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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.1007/s00453-022-01086-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01086-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01086-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-022-01086-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01086-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01086-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321613","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4313421121.pdf","grobid_xml":"https://content.openalex.org/works/W4313421121.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W1549638383","https://openalex.org/W1598698067","https://openalex.org/W1608639859","https://openalex.org/W1762430620","https://openalex.org/W1973069886","https://openalex.org/W1980985059","https://openalex.org/W1985123706","https://openalex.org/W2012010258","https://openalex.org/W2022418489","https://openalex.org/W2030087828","https://openalex.org/W2030398195","https://openalex.org/W2032797941","https://openalex.org/W2066253573","https://openalex.org/W2067612530","https://openalex.org/W2074078071","https://openalex.org/W2078992232","https://openalex.org/W2099677042","https://openalex.org/W2104498537","https://openalex.org/W2120358419","https://openalex.org/W2124558257","https://openalex.org/W2133263321","https://openalex.org/W2135165032","https://openalex.org/W2141898804","https://openalex.org/W2142336599","https://openalex.org/W2146489710","https://openalex.org/W2148417962","https://openalex.org/W2358239530","https://openalex.org/W2548938557","https://openalex.org/W2560847365","https://openalex.org/W2584383026","https://openalex.org/W2607257393","https://openalex.org/W2611323361","https://openalex.org/W2739491435","https://openalex.org/W2797698037","https://openalex.org/W2801165240","https://openalex.org/W2904950256","https://openalex.org/W2964874319","https://openalex.org/W2988480584","https://openalex.org/W3095965934","https://openalex.org/W3146365460","https://openalex.org/W3153097307","https://openalex.org/W4205305404","https://openalex.org/W4300568640","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W3089158720","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W1987322712"],"abstract_inverted_index":{"Abstract":[0],"In":[1,33,56],"this":[2],"work,":[3],"we":[4,37,58,109],"advance":[5],"the":[6,9,21,78,95,103,132,143,150,156,165,197,213,221],"understanding":[7],"of":[8,12,23,42,105,138,145,149,159,212,220],"fundamental":[10],"limits":[11],"computation":[13],"for":[14,64],"binary":[15,31],"polynomial":[16,27,137],"optimization":[17],"(BPO),":[18],"which":[19,113],"is":[20,69,85,114,122,126,135,167],"problem":[22,98,166,186],"maximizing":[24],"a":[25,39,51,60,118,136,200,205],"given":[26],"function":[28],"over":[29,161],"all":[30],"points.":[32],"our":[34,106,124],"main":[35],"result":[36,153],"provide":[38],"novel":[40],"class":[41],"BPO":[43,160,185],"that":[44,77,187],"can":[45,178],"be":[46,180],"solved":[47],"efficiently":[48],"both":[49],"from":[50,117],"theoretical":[52],"and":[53,94,131,147],"computational":[54,157],"perspective.":[55],"fact,":[57],"give":[59],"strongly":[61],"polynomial-time":[62],"algorithm":[63,112,125,177,198],"instances":[65],"whose":[66],"corresponding":[67],"hypergraph":[68],"$$\\beta":[70,79,189],"$$":[71,80,171,190],"<mml:math":[72,81,172,191],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mi>\u03b2</mml:mi></mml:math>":[73,82,192],"-acyclic.":[74],"We":[75],"note":[76],"-acyclicity":[83],"assumption":[84],"natural":[86],"in":[87,142],"several":[88],"applications":[89],"including":[90],"relational":[91],"database":[92],"schemes":[93],"lifted":[96],"multicut":[97],"on":[99,169],"trees.":[100],"Due":[101],"to":[102,129,182,207,216],"novelty":[104],"proving":[107],"technique,":[108],"obtain":[110],"an":[111,217],"interesting":[115],"also":[116,179],"practical":[119],"viewpoint.":[120],"This":[121],"because":[123],"very":[127,139],"simple":[128],"implement":[130],"running":[133],"time":[134],"low":[140],"degree":[141],"number":[144],"nodes":[146],"edges":[148],"hypergraph.":[151],"Our":[152,176],"completely":[154],"settles":[155],"complexity":[158],"acyclic":[162],"hypergraphs,":[163],"since":[164],"NP-hard":[168],"$$\\alpha":[170],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mi>\u03b1</mml:mi></mml:math>":[173],"-acyclic":[174],"instances.":[175],"applied":[181],"any":[183,209],"general":[184],"contains":[188],"-cycles.":[193],"For":[194],"these":[195],"problems,":[196],"returns":[199],"smaller":[201,214],"instance":[202,215],"together":[203],"with":[204],"rule":[206],"extend":[208],"optimal":[210,218],"solution":[211,219],"original":[222],"instance.":[223]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}