{"id":"https://openalex.org/W3174938715","doi":"https://doi.org/10.1109/lics52264.2021.9470706","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":2021,"publication_date":"2021-06-29","ids":{"openalex":"https://openalex.org/W3174938715","doi":"https://doi.org/10.1109/lics52264.2021.9470706","mag":"3174938715"},"language":"en","primary_location":{"id":"doi:10.1109/lics52264.2021.9470706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","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/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.148,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49948209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"32","issue":null,"first_page":"1","last_page":"13"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10142","display_name":"Formal Methods in Verification","score":0.9959999918937683,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.6078718900680542},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5208471417427063},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.48907285928726196},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48680898547172546},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4525907337665558},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43801623582839966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40928560495376587},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3756237030029297},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37230950593948364}],"concepts":[{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.6078718900680542},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5208471417427063},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.48907285928726196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48680898547172546},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4525907337665558},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43801623582839966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40928560495376587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3756237030029297},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37230950593948364},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics52264.2021.9470706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W149380172","https://openalex.org/W183568742","https://openalex.org/W217941633","https://openalex.org/W1489366126","https://openalex.org/W1569165539","https://openalex.org/W1608352849","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/W2245089271","https://openalex.org/W2282320536","https://openalex.org/W2743861372","https://openalex.org/W2787022562","https://openalex.org/W2809340088","https://openalex.org/W2962831944","https://openalex.org/W2996910805","https://openalex.org/W3047645840","https://openalex.org/W4240656561","https://openalex.org/W4287693218","https://openalex.org/W6672423942","https://openalex.org/W6750040546","https://openalex.org/W6852464093"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W172022518","https://openalex.org/W124145845","https://openalex.org/W4293114312","https://openalex.org/W1970560677","https://openalex.org/W2378491141","https://openalex.org/W4362700221","https://openalex.org/W2090103360","https://openalex.org/W1700814124","https://openalex.org/W3103887953"],"abstract_inverted_index":{"We":[0,25],"study":[1],"the":[2,11,35,89],"extent":[3],"to":[4,9,47],"which":[5],"it":[6],"is":[7,92],"possible":[8],"approximate":[10],"optimal":[12],"value":[13],"of":[14,37,64,72,88],"a":[15,38,61,77],"Unique":[16,33],"Games":[17],"instance":[18],"in":[19],"Fixed-Point":[20],"Logic":[21],"with":[22],"Counting":[23],"(FPC).":[24],"prove":[26],"two":[27],"new":[28],"FPC-":[29],"inexpressibility":[30],"results":[31,59,83],"for":[32,60],"Games:":[34],"existence":[36],"(":[39],"\\frac12,\\frac13":[40],"+":[41],"\u03b4":[42],")-inapproximability":[43],"gap,":[44],"and":[45],"inapproximability":[46],"within":[48],"any":[49],"constant":[50],"factor.":[51],"Previous":[52],"recent":[53],"work":[54],"has":[55],"established":[56],"similar":[57],"FPC-inapproximability":[58],"small":[62],"handful":[63],"other":[65],"problems.":[66],"Our":[67],"construction":[68],"builds":[69],"upon":[70],"some":[71],"these":[73],"ideas,":[74],"but":[75],"contains":[76],"novel":[78],"technique.":[79],"While":[80],"most":[81],"FPC-inexpressibility":[82],"are":[84],"based":[85],"on":[86],"variants":[87],"CFI-construction,":[90],"ours":[91],"significantly":[93],"different.":[94]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}