{"id":"https://openalex.org/W1979065044","doi":"https://doi.org/10.1137/120882718","title":"On the NP-Hardness of Max-Not-2","display_name":"On the NP-Hardness of Max-Not-2","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1979065044","doi":"https://doi.org/10.1137/120882718","mag":"1979065044"},"language":"en","primary_location":{"id":"doi:10.1137/120882718","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120882718","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/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"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":"Johan H\u00e5stad","raw_affiliation_strings":["KTH\u00a0\u2013 Royal Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH\u00a0\u2013 Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013166918"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":2.1442,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86740369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"43","issue":"1","first_page":"179","last_page":"193"},"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.9988999962806702,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/arity","display_name":"Arity","score":0.8979654312133789},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7596355676651001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6641953587532043},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6298182010650635},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5691490769386292},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4783313274383545},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47621068358421326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44843074679374695},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.44642069935798645}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.8979654312133789},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7596355676651001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6641953587532043},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6298182010650635},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5691490769386292},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4783313274383545},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47621068358421326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44843074679374695},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.44642069935798645},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/120882718","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120882718","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.261.3494","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.261.3494","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nada.kth.se/%7Ejohanh/nottwo.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W573138702","https://openalex.org/W1559728639","https://openalex.org/W1967935161","https://openalex.org/W1970259241","https://openalex.org/W1973898585","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2008724760","https://openalex.org/W2081254453","https://openalex.org/W2083360043","https://openalex.org/W2096478102","https://openalex.org/W2120358419","https://openalex.org/W2125534993","https://openalex.org/W2144539217","https://openalex.org/W2148352980","https://openalex.org/W2162784288","https://openalex.org/W2163430289","https://openalex.org/W2169488047"],"related_works":["https://openalex.org/W2155910042","https://openalex.org/W3021221643","https://openalex.org/W3184046060","https://openalex.org/W3061362066","https://openalex.org/W2626872748","https://openalex.org/W70192758","https://openalex.org/W2751025771","https://openalex.org/W1492779419","https://openalex.org/W1990734013","https://openalex.org/W3037784751"],"abstract_inverted_index":{"We":[0],"prove":[1],"that,":[2],"for":[3],"any":[4],"$\\epsilon>0$,":[5],"given":[6],"a":[7,22],"satisfiable":[8,70],"instance":[9],"of":[10,27,35,78],"Max-NTW":[11,65],"(Not-2),":[12],"it":[13],"is":[14,57,66],"NP-hard":[15],"to":[16,32,87],"find":[17],"an":[18,49],"assignment":[19,50],"that":[20,46,64],"satisfies":[21],"fraction":[23],"$\\frac":[24],"58":[25],"+\\epsilon$":[26],"the":[28,33,38,43,55,61],"constraints.":[29],"This,":[30],"up":[31],"existence":[34],"$\\epsilon$,":[36],"matches":[37],"approximation":[39,67,88],"ratio":[40],"obtained":[41],"by":[42],"trivial":[44],"algorithm":[45],"just":[47],"picks":[48],"at":[51],"random,":[52],"and":[53,72],"thus":[54],"result":[56,62],"tight.":[58],"Said":[59],"equivalently,":[60],"proves":[63],"resistant":[68],"on":[69],"instances,":[71],"this":[73],"makes":[74],"complete":[75],"our":[76],"understanding":[77],"arity":[79],"three":[80],"maximum":[81],"constraint":[82],"satisfaction":[83],"problems":[84],"with":[85],"regards":[86],"resistance.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}