{"id":"https://openalex.org/W2081537403","doi":"https://doi.org/10.1145/2488608.2488666","title":"Approximation resistance on satisfiable instances for predicates with few accepting inputs","display_name":"Approximation resistance on satisfiable instances for predicates with few accepting inputs","publication_year":2013,"publication_date":"2013-05-28","ids":{"openalex":"https://openalex.org/W2081537403","doi":"https://doi.org/10.1145/2488608.2488666","mag":"2081537403"},"language":"en","primary_location":{"id":"doi:10.1145/2488608.2488666","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-124328","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047872044","display_name":"Sangxia Huang","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":"Sangxia Huang","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047872044"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":2.1752,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87973303,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"457","last_page":"466"},"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.9998999834060669,"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.9998999834060669,"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.9994000196456909,"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.9944000244140625,"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/soundness","display_name":"Soundness","score":0.8170353174209595},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.7882392406463623},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.631125271320343},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5651768445968628},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4905657172203064},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.44537192583084106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4306780695915222},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4292803108692169},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4019988775253296},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10853317379951477}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.8170353174209595},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.7882392406463623},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.631125271320343},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5651768445968628},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4905657172203064},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44537192583084106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4306780695915222},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4292803108692169},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4019988775253296},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10853317379951477},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2488608.2488666","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:DiVA.org:kth-124328","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-124328","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:kth-124328","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-124328","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W3973702","https://openalex.org/W573138702","https://openalex.org/W1521487341","https://openalex.org/W1530739071","https://openalex.org/W1577891761","https://openalex.org/W1586488998","https://openalex.org/W1967935161","https://openalex.org/W1970259241","https://openalex.org/W1973433258","https://openalex.org/W1973898585","https://openalex.org/W1975810219","https://openalex.org/W1979065044","https://openalex.org/W1991143034","https://openalex.org/W1992068214","https://openalex.org/W1992771184","https://openalex.org/W1999032440","https://openalex.org/W2008724760","https://openalex.org/W2019578639","https://openalex.org/W2038663599","https://openalex.org/W2055711302","https://openalex.org/W2073029179","https://openalex.org/W2078929687","https://openalex.org/W2081192873","https://openalex.org/W2091921997","https://openalex.org/W2096478102","https://openalex.org/W2097823813","https://openalex.org/W2098363469","https://openalex.org/W2115404728","https://openalex.org/W2120358419","https://openalex.org/W2125534993","https://openalex.org/W2126331452","https://openalex.org/W2129025918","https://openalex.org/W2133263321","https://openalex.org/W2148352980","https://openalex.org/W2154276597","https://openalex.org/W2162117620","https://openalex.org/W2163430289","https://openalex.org/W2169488047","https://openalex.org/W2179897858","https://openalex.org/W2898230027","https://openalex.org/W6600155029"],"related_works":["https://openalex.org/W13634261","https://openalex.org/W3163509751","https://openalex.org/W958050847","https://openalex.org/W1548499332","https://openalex.org/W2396405675","https://openalex.org/W1549730417","https://openalex.org/W1994524667","https://openalex.org/W3145683101","https://openalex.org/W4298974867","https://openalex.org/W2129933223"],"abstract_inverted_index":{"We":[0,94],"prove":[1],"that":[2,22],"for":[3],"all":[4],"integer":[5],"k":[6,15],"\u2265":[7],"3,":[8],"there":[9],"is":[10,23,71,78],"a":[11,33],"predicate":[12,64],"P":[13],"on":[14,27,109],"Boolean":[16],"variables":[17],"with":[18,37,104],"2~O(k1/3)":[19],"accepting":[20,67],"assignments":[21],"approximation":[24,44],"resistant":[25],"even":[26],"satisfiable":[28,34],"instances.":[29],"That":[30],"is,":[31],"given":[32],"CSP":[35],"instance":[36],"constraint":[38],"P,":[39],"we":[40],"cannot":[41],"achieve":[42],"better":[43],"ratio":[45],"than":[46],"simply":[47],"picking":[48],"random":[49],"assignments.":[50,68],"This":[51],"improves":[52],"the":[53,63,79,110],"best":[54],"previously":[55],"known":[56],"result":[57],"by":[58,73,91],"Hastad":[59],"and":[60],"Khot":[61],"where":[62],"has":[65],"2O(k1/2)":[66],"Our":[69],"construction":[70],"inspired":[72],"several":[74],"recent":[75],"developments.":[76],"One":[77],"idea":[80],"of":[81,88],"using":[82],"direct":[83],"sums":[84],"to":[85,101],"improve":[86],"soundness":[87],"PCPs,":[89],"developed":[90],"Chan":[92],"[5].":[93],"also":[95],"use":[96],"techniques":[97],"from":[98],"Wenner":[99],"[32]":[100],"construct":[102],"PCPs":[103],"perfect":[105],"completeness":[106],"without":[107],"relying":[108],"d-to-1":[111],"Conjecture.":[112]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}