{"id":"https://openalex.org/W3157712555","doi":"https://doi.org/10.46298/lmcs-20(2:3)2024","title":"Inapproximability of Unique Games in Fixed-Point Logic with Counting","display_name":"Inapproximability of Unique Games in Fixed-Point Logic with Counting","publication_year":2024,"publication_date":"2024-04-10","ids":{"openalex":"https://openalex.org/W3157712555","doi":"https://doi.org/10.46298/lmcs-20(2:3)2024","mag":"3157712555"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-20(2:3)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(2:3)2024","pdf_url":"https://lmcs.episciences.org/13380/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/13380/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035370064","display_name":"Jamie Tucker-Foltz","orcid":"https://orcid.org/0000-0001-9174-3341"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jamie Tucker-Foltz","raw_affiliation_strings":["Harvard University"],"affiliations":[{"raw_affiliation_string":"Harvard University","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035370064"],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00349127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 20, Issue 2","issue":null,"first_page":null,"last_page":null},"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.9991000294685364,"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.9991000294685364,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9954000115394592,"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/combinatorics","display_name":"Combinatorics","score":0.6036895513534546},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5552394986152649},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49372515082359314},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4617038369178772},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.4218195080757141}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6036895513534546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5552394986152649},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49372515082359314},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4617038369178772},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4218195080757141},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","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},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-20(2:3)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(2:3)2024","pdf_url":"https://lmcs.episciences.org/13380/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2104.04566","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2104.04566","pdf_url":"https://arxiv.org/pdf/2104.04566","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:46e4a9de2158459ca6f58435f370cad5","is_oa":true,"landing_page_url":"https://doaj.org/article/46e4a9de2158459ca6f58435f370cad5","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 20, Issue 2 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-20(2:3)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(2:3)2024","pdf_url":"https://lmcs.episciences.org/13380/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310582","display_name":"Winston Churchill Foundation of the United States","ror":"https://ror.org/02b6r2g85"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3157712555.pdf"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W51516856","https://openalex.org/W183568742","https://openalex.org/W238274961","https://openalex.org/W1489366126","https://openalex.org/W1569165539","https://openalex.org/W1608352849","https://openalex.org/W1980103601","https://openalex.org/W1989783863","https://openalex.org/W1993886628","https://openalex.org/W2073029179","https://openalex.org/W2087806988","https://openalex.org/W2088094394","https://openalex.org/W2114448228","https://openalex.org/W2117220151","https://openalex.org/W2128148743","https://openalex.org/W2152035036","https://openalex.org/W2211319681","https://openalex.org/W2245089271","https://openalex.org/W2282320536","https://openalex.org/W2787022562","https://openalex.org/W2794354412","https://openalex.org/W2809340088","https://openalex.org/W2996910805","https://openalex.org/W4240656561","https://openalex.org/W4287693218","https://openalex.org/W4300033161","https://openalex.org/W6903114607"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"We":[0,57,125],"study":[1],"the":[2,11,31,48,66,119,136,147,150,166,170],"extent":[3],"to":[4,9,44,77],"which":[5],"it":[6],"is":[7,122],"possible":[8],"approximate":[10,49],"optimal":[12],"value":[13],"of":[14,33,51,68,94,102,118,130,169],"a":[15,69,91,107,128,157,161],"Unique":[16,37,64],"Games":[17,38],"instance":[18],"in":[19,149],"Fixed-Point":[20],"Logic":[21],"with":[22,127,138],"Counting":[23],"(FPC).":[24],"Formally,":[25],"we":[26],"prove":[27,58],"lower":[28],"bounds":[29],"against":[30],"accuracy":[32],"FPC-interpretations":[34],"that":[35,53,145,164],"map":[36],"instances":[39],"(encoded":[40],"as":[41],"relational":[42],"structures)":[43],"rational":[45],"numbers":[46],"giving":[47],"fraction":[50],"constraints":[52,148],"can":[54],"be":[55],"satisfied.":[56],"two":[59,151],"new":[60],"FPC-inexpressibility":[61,112],"results":[62,89,113],"for":[63,90],"Games:":[65],"existence":[67],"$(1/2,":[70],"1/3":[71],"+":[72],"\\delta)$-inapproximability":[73],"gap,":[74],"and":[75,134],"inapproximability":[76],"within":[78],"any":[79],"constant":[80],"factor.":[81],"Previous":[82],"recent":[83],"work":[84],"has":[85],"established":[86],"similar":[87],"FPC-inapproximability":[88],"small":[92],"handful":[93],"other":[95],"problems.":[96],"Our":[97],"construction":[98],"builds":[99],"upon":[100],"some":[101],"these":[103],"ideas,":[104],"but":[105],"contains":[106],"novel":[108],"technique.":[109],"While":[110],"most":[111],"are":[114],"based":[115],"on":[116],"variants":[117],"CFI-construction,":[120],"ours":[121],"significantly":[123],"different.":[124],"start":[126],"graph":[129],"very":[131],"large":[132],"girth":[133],"label":[135],"edges":[137],"random":[139],"affine":[140],"vector":[141],"spaces":[142],"over":[143,160],"$\\mathbb{F}_2$":[144],"determine":[146],"structures.":[152],"Duplicator's":[153],"strategy":[154],"involves":[155],"maintaining":[156],"partial":[158],"isomorphism":[159],"minimal":[162],"tree":[163],"spans":[165],"pebbled":[167],"vertices":[168],"graph.":[171]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}