{"id":"https://openalex.org/W3037538996","doi":"https://doi.org/10.4086/toc.2013.v009a023","title":"","display_name":"","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W3037538996","doi":"https://doi.org/10.4086/toc.2013.v009a023","mag":"3037538996"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2013.v009a023","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a023","pdf_url":"https://theoryofcomputing.org/articles/v009a023/v009a023.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v009a023/v009a023.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089148248","display_name":"Cenny Wenner","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cenny Wenner","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089148248"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3318,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.92650919,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"1","first_page":"703","last_page":"757"},"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.9937999844551086,"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.9937999844551086,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9639999866485596,"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.9465000033378601,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7446238994598389},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.6883325576782227},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6788261532783508},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5683645606040955},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5096490383148193},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4993438720703125},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.43850553035736084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4280998706817627},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.413772314786911},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19670513272285461}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7446238994598389},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6883325576782227},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6788261532783508},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5683645606040955},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5096490383148193},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4993438720703125},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.43850553035736084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4280998706817627},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.413772314786911},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19670513272285461},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4086/toc.2013.v009a023","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a023","pdf_url":"https://theoryofcomputing.org/articles/v009a023/v009a023.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:su-107681","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-107681","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":"Article in journal"}],"best_oa_location":{"id":"doi:10.4086/toc.2013.v009a023","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a023","pdf_url":"https://theoryofcomputing.org/articles/v009a023/v009a023.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3037538996.pdf","grobid_xml":"https://content.openalex.org/works/W3037538996.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W122014950","https://openalex.org/W573138702","https://openalex.org/W1521487341","https://openalex.org/W1970259241","https://openalex.org/W1973898585","https://openalex.org/W1992068214","https://openalex.org/W1999032440","https://openalex.org/W2008724760","https://openalex.org/W2038225707","https://openalex.org/W2038663599","https://openalex.org/W2047861934","https://openalex.org/W2073029179","https://openalex.org/W2078929687","https://openalex.org/W2081537403","https://openalex.org/W2094654291","https://openalex.org/W2096478102","https://openalex.org/W2120358419","https://openalex.org/W2125534993","https://openalex.org/W2143996311","https://openalex.org/W2144539217","https://openalex.org/W2162784288","https://openalex.org/W2163430289","https://openalex.org/W2169488047","https://openalex.org/W2179897858","https://openalex.org/W2898230027","https://openalex.org/W4205962651","https://openalex.org/W4226347946","https://openalex.org/W4300471124"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2963411648","https://openalex.org/W2115404728","https://openalex.org/W2952838392","https://openalex.org/W2016001296","https://openalex.org/W2019123979","https://openalex.org/W3125240838","https://openalex.org/W1606488336"],"abstract_inverted_index":{"Hstad":[0],"established":[1],"that":[2,61],"any":[3],"predicate":[4],"P":[5],"{0,":[6],"1}":[7],"m":[8],"containing":[9,64],"Parity":[10,65],"of":[11,30,40,66],"width":[12,67],"at":[13,68],"least":[14,69],"three":[15,70],"is":[16],"approximation":[17,28,72],"resistant":[18,73],"for":[19,25,75],"almost-satisfiable":[20],"instances.":[21,42],"In":[22],"comparison":[23],"to":[24,56],"example":[26],"the":[27,38,58,79],"hardness":[29,39],"3SAT,":[31],"this":[32],"general":[33],"result":[34,60],"however":[35],"left":[36],"open":[37],"perfectly-satisfiable":[41],"This":[43],"limitation":[44],"was":[45],"addressed":[46],"by":[47,54],"O'Donnell":[48],"and":[49,51],"Wu,":[50],"subsequently":[52],"generalized":[53],"Huang,":[55],"show":[57],"threshold":[59],"predicates":[62],"strictly":[63],"are":[71],"also":[74],"perfectlysatisfiable":[76],"instances,":[77],"assuming":[78],"d-to-1":[80],"Conjecture.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2020-07-02T00:00:00"}