{"id":"https://openalex.org/W1994118705","doi":"https://doi.org/10.1137/s0097539794266407","title":"On Unapproximable Versions of $NP$-Complete Problems","display_name":"On Unapproximable Versions of $NP$-Complete Problems","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W1994118705","doi":"https://doi.org/10.1137/s0097539794266407","mag":"1994118705"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794266407","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794266407","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5052332525","display_name":"David Zuckerman","orcid":"https://orcid.org/0000-0002-4749-3223"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Zuckerman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052332525"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.2006,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.96571274,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"25","issue":"6","first_page":"1293","last_page":"1304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9991000294685364,"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"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.764576256275177},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7070239782333374},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6944024562835693},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6313346028327942},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6270675659179688},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6207906603813171},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.5853419303894043},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5456060767173767},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5260967016220093},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5239111185073853},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5078011155128479},{"id":"https://openalex.org/keywords/law-of-the-iterated-logarithm","display_name":"Law of the iterated logarithm","score":0.47737976908683777},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4758974015712738},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4744342863559723},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4349300265312195},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43291985988616943},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11970251798629761}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.764576256275177},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7070239782333374},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6944024562835693},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6313346028327942},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6270675659179688},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6207906603813171},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.5853419303894043},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5456060767173767},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5260967016220093},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5239111185073853},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5078011155128479},{"id":"https://openalex.org/C139907963","wikidata":"https://www.wikidata.org/wiki/Q198740","display_name":"Law of the iterated logarithm","level":3,"score":0.47737976908683777},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4758974015712738},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4744342863559723},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4349300265312195},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43291985988616943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11970251798629761},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539794266407","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794266407","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2006912660","https://openalex.org/W2038225707","https://openalex.org/W2053204254","https://openalex.org/W2053651631","https://openalex.org/W2055656009","https://openalex.org/W2094500233","https://openalex.org/W2155506366","https://openalex.org/W2401610261","https://openalex.org/W4206709181","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W3044099633","https://openalex.org/W35149855","https://openalex.org/W2963439929","https://openalex.org/W2962677563","https://openalex.org/W4301869063","https://openalex.org/W3181822391","https://openalex.org/W4287084576","https://openalex.org/W4237554979","https://openalex.org/W2261299644","https://openalex.org/W3103672472"],"abstract_inverted_index":{"We":[0,33,85],"prove":[1],"that":[2,13,36,97,114],"all":[3],"of":[4,55,58,108,127,139],"Karp's":[5],"21":[6],"original":[7,24],"$NP$-complete":[8],"problems":[9,25,38,60],"have":[10],"a":[11,106,131],"version":[12],"is":[14,78,100,116],"hard":[15,41,101],"to":[16,42,61,90,102,104,119,130],"approximate.":[17,43],"These":[18],"versions":[19],"are":[20,39],"obtained":[21],"from":[22],"the":[23,29,56,71,87,92,125,137],"by":[26,80],"adding":[27],"essentially":[28],"same":[30,88],"simple":[31],"constraint.":[32],"further":[34],"show":[35,113],"these":[37,59],"absurdly":[40],"In":[44],"fact,":[45],"no":[46],"polynomial-time":[47],"algorithm":[48],"can":[49],"even":[50,117],"approximate":[51,103,120],"$\\log":[52,67],"^{(k)}":[53,68],"$":[54,69,95,140],"magnitude":[57],"within":[62,105],"any":[63],"constant":[64,93],"factor,":[65],"where":[66],"denotes":[70],"logarithm":[72],"iterated":[73],"k":[74],"times,":[75],"unless":[76],"$NP$":[77],"recognized":[79],"slightly":[81],"superpolynomial":[82],"randomized":[83],"machines.":[84],"use":[86],"technique":[89],"improve":[91],"$\\epsilon":[94],"such":[96],"MAX":[98],"CLIQUE":[99],"factor":[107],"$n^\\epsilon":[109],"$.":[110],"Finally,":[111],"we":[112],"it":[115],"harder":[118],"two":[121],"counting":[122,124],"problems:":[123],"number":[126],"satisfying":[128],"assignments":[129],"monotone":[132],"2SAT":[133],"formula":[134],"and":[135],"computing":[136],"permanent":[138],"-":[141],"1,0,1$":[142],"matrices.":[143]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":8}],"updated_date":"2026-05-13T08:25:38.343686","created_date":"2025-10-10T00:00:00"}