{"id":"https://openalex.org/W3116040961","doi":"https://doi.org/10.1137/1.9781611976465.27","title":"Optimal Inapproximability with Universal Factor Graphs","display_name":"Optimal Inapproximability with Universal Factor Graphs","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3116040961","doi":"https://doi.org/10.1137/1.9781611976465.27","mag":"3116040961"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611976465.27","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"book-chapter","type_crossref":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":"https://doi.org/10.1137/1.9781611976465.27","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055776088","display_name":"Per Austrin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Per Austrin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050009197","display_name":"Jonah Brown-Cohen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonah Brown-Cohen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013166918","display_name":"Johan H\u030aastad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johan H\u00e5stad","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.582,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.541918,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":66,"max":71},"biblio":{"volume":null,"issue":null,"first_page":"434","last_page":"453"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9968,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9968,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.984,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.933,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6530491},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6520504},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.63259983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5190638},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48710608},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44176003},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33530623},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611976465.27","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611976465.27","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4390409907","https://openalex.org/W4221143622","https://openalex.org/W2953461625","https://openalex.org/W2586280130","https://openalex.org/W2372768926","https://openalex.org/W2371352078","https://openalex.org/W2089088747","https://openalex.org/W2080136900","https://openalex.org/W2077383796","https://openalex.org/W1981723335"],"abstract_inverted_index":{"The":[0],"factor":[1,32,64],"graph":[2,15,33,65],"of":[3,6,25,38,73,80,108,137],"an":[4],"instance":[5,24],"a":[7,36,134],"constraint":[8],"satisfaction":[9],"problem":[10,113],"(CSP)":[11],"is":[12,28,41,66,133],"the":[13,26,31,58,63,71,74,109,139],"bipartite":[14],"indicating":[16],"which":[17,39,142],"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,83,89,98],"We":[46],"establish":[47,130],"that":[48],"many":[49],"Max-CSPs":[50],"remain":[51],"as":[52,56],"hard":[53],"to":[54,129],"approximate":[55],"general":[59],"case":[60],"even":[61],"when":[62],"fixed":[67],"(depending":[68],"only":[69],"on":[70],"size":[72],"instance)":[75],"and":[76,91,114],"known":[77],"advance.Examples":[79],"results":[81,132],"obtained":[82],"this":[84],"restricted":[85],"setting":[86],"are:1.Optimal":[87],"inapproximability":[88],"Max-3-Lin":[90],"Max-3-Sat":[92],"(H\u00e5stad,":[93],"J.":[94,105,122],"ACM":[95,106],"2001).2.Approximation":[96],"resistance":[97],"predicates":[99],"supporting":[100],"pairwise":[101],"independent":[102],"subgroups":[103],"(Chan,":[104],"2016).3.Hardness":[107],"\"(2":[110],"+":[111],"\u220a)-Sat\"":[112],"other":[115],"Promise":[116],"CSPs":[117],"(Austrin":[118],"et":[119],"al.,":[120],"SIAM":[121],"Comput.":[123],"2017).The":[124],"main":[125],"technical":[126],"tool":[127],"used":[128],"these":[131],"new":[135],"way":[136],"folding":[138],"long":[140],"code":[141],"we":[143],"call":[144],"\"functional":[145],"folding\".":[146]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3116040961","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-04-03T08:10:57.781629","created_date":"2021-01-05"}