{"id":"https://openalex.org/W2990811009","doi":"https://doi.org/10.1145/3631119","title":"Optimal Inapproximability with Universal Factor Graphs","display_name":"Optimal Inapproximability with Universal Factor Graphs","publication_year":2023,"publication_date":"2023-12-15","ids":{"openalex":"https://openalex.org/W2990811009","doi":"https://doi.org/10.1145/3631119","mag":"2990811009"},"language":"en","primary_location":{"id":"doi:10.1145/3631119","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631119","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631119","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3631119","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055776088","display_name":"Per Austrin","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Per Austrin","raw_affiliation_strings":["KTH Royal Institute of Technology","KTH Royal Institute of Technology, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-8217-0158","affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"KTH Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050009197","display_name":"Jonah Brown-Cohen","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]},{"id":"https://openalex.org/I4210090411","display_name":"Google DeepMind (United Kingdom)","ror":"https://ror.org/00971b260","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210090411","https://openalex.org/I4210128969"]},{"id":"https://openalex.org/I4210113297","display_name":"Google (United Kingdom)","ror":"https://ror.org/024bc3e07","country_code":"GB","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210113297","https://openalex.org/I4210128969"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Jonah Brown-Cohen","raw_affiliation_strings":["Google DeepMind","Google DeepMind, UK"],"raw_orcid":"https://orcid.org/0000-0002-4294-8671","affiliations":[{"raw_affiliation_string":"Google DeepMind","institution_ids":["https://openalex.org/I1291425158","https://openalex.org/I4210090411"]},{"raw_affiliation_string":"Google DeepMind, UK","institution_ids":["https://openalex.org/I4210113297","https://openalex.org/I4210090411"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan H\u00e5stad","raw_affiliation_strings":["KTH Royal Institute of Technology","KTH Royal Institute of Technology, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-5379-345X","affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"KTH Royal Institute of Technology, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055776088"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6053505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"21","issue":"3","first_page":"1","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6489850878715515},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6234502792358398},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6063443422317505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5469340682029724},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4956568479537964},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4190126061439514},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3252953290939331}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6489850878715515},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6234502792358398},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6063443422317505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5469340682029724},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4956568479537964},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4190126061439514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3252953290939331},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3631119","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631119","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631119","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3631119","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3631119","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3631119","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2990811009.pdf","grobid_xml":"https://content.openalex.org/works/W2990811009.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1502275094","https://openalex.org/W1565047086","https://openalex.org/W1970259241","https://openalex.org/W1973270757","https://openalex.org/W1979065044","https://openalex.org/W1999032440","https://openalex.org/W2014086530","https://openalex.org/W2031364557","https://openalex.org/W2069278600","https://openalex.org/W2087038607","https://openalex.org/W2096478102","https://openalex.org/W2111385661","https://openalex.org/W2111829945","https://openalex.org/W2146489710","https://openalex.org/W2152243261","https://openalex.org/W2153413398","https://openalex.org/W2169488047","https://openalex.org/W2172366597","https://openalex.org/W2247877609","https://openalex.org/W2400082414","https://openalex.org/W2497660909","https://openalex.org/W2514739098","https://openalex.org/W2758570758","https://openalex.org/W2776885602","https://openalex.org/W2963010019","https://openalex.org/W3007452340"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W4390409907","https://openalex.org/W3085245180","https://openalex.org/W2586280130","https://openalex.org/W4221143622","https://openalex.org/W1981723335","https://openalex.org/W4245692971"],"abstract_inverted_index":{"The":[0,130],"factor":[1,32,64],"graph":[2,15,33,65],"of":[3,6,25,38,73,81,115,143],"an":[4],"instance":[5,24],"a":[7,36,140],"constraint":[8],"satisfaction":[9],"problem":[10,118],"(CSP)":[11],"is":[12,28,41,66,139],"the":[13,26,31,58,63,71,74,116,145],"bipartite":[14],"indicating":[16],"which":[17,39,148],"variables":[18],"appear":[19],"in":[20,57,78],"each":[21,44],"constraint.":[22,45],"An":[23],"CSP":[27],"given":[29],"by":[30],"together":[34],"with":[35],"list":[37],"predicate":[40],"applied":[42],"for":[43,84,92,103],"We":[46],"establish":[47,136],"that":[48],"many":[49],"Max-CSPs":[50],"remain":[51],"as":[52,56],"hard":[53],"to":[54,135],"approximate":[55],"general":[59],"case":[60],"even":[61],"when":[62],"fixed":[67],"(depending":[68],"only":[69],"on":[70],"size":[72],"instance)":[75],"and":[76,94,119],"known":[77],"advance.":[79],"Examples":[80],"results":[82,138],"obtained":[83],"this":[85],"restricted":[86],"setting":[87],"are:":[88],"(1)":[89],"Optimal":[90],"inapproximability":[91],"Max-3-Lin":[93],"Max-3-Sat":[95],"(H\u00e5stad,":[96],"J.":[97,110,127],"ACM":[98,111],"2001).":[99],"(2)":[100],"Approximation":[101],"resistance":[102],"predicates":[104],"supporting":[105],"pairwise":[106],"independent":[107],"subgroups":[108],"(Chan,":[109],"2016).":[112],"(3)":[113],"Hardness":[114],"\u201c(2+\u025b)-Sat\u201d":[117],"other":[120],"Promise":[121],"CSPs":[122],"(Austrin":[123],"et":[124],"al.,":[125],"SIAM":[126],"Comput.":[128],"2017).":[129],"main":[131],"technical":[132],"tool":[133],"used":[134],"these":[137],"new":[141],"way":[142],"folding":[144],"long":[146],"code":[147],"we":[149],"call":[150],"\u201cfunctional":[151],"folding\u201d.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}