{"id":"https://openalex.org/W23339264","doi":null,"title":"NP-complete problems","display_name":"NP-complete problems","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W23339264","mag":"23339264"},"language":"en","primary_location":{"id":"mag:23339264","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1074646","pdf_url":null,"source":{"id":"https://openalex.org/S4306509340","display_name":"Encyclopedia of Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Encyclopedia of Computer Science","raw_type":null},"volume":null,"type":"reference-entry","is_traditional":false,"indexed_in":[],"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/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197","observed_orcids":["https://orcid.org/0000-0002-7044-0197"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel J. Rosenkrantz","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-7044-0197","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052202085","display_name":"Richard Edwin Stearns","orcid":"https://orcid.org/0000-0001-5058-1999","observed_orcids":["https://orcid.org/0000-0001-5058-1999"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard E. Stearns","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5058-1999","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1252","last_page":"1256"},"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.9824000000953674,"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.9824000000953674,"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.016699999570846558,"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/T11269","display_name":"Algorithms and Data Compression","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/np-complete-problems","display_name":"NP-complete problems","score":1.0},{"id":"https://openalex.org/keywords/nondeterministic-polynomial-time","display_name":"nondeterministic polynomial time","score":0.9039999842643738},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.7799999713897705},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.8539999723434448},{"id":"https://openalex.org/keywords/exponential-time-algorithms","display_name":"exponential-time algorithms","score":0.9990000128746033},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"algorithmic complexity","score":0.5839999914169312},{"id":"https://openalex.org/keywords/intractable-problems","display_name":"intractable problems","score":0.7549999952316284},{"id":"https://openalex.org/keywords/problem-size","display_name":"problem size","score":0.40299999713897705}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8337814807891846},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6785522699356079},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.673668622970581},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5971840023994446},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.596996545791626},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5570164322853088},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5545983910560608},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5252601504325867},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.4675509035587311},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44144654273986816},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4344837963581085},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36094188690185547},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3222430944442749},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.13240954279899597},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:23339264","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1074646","pdf_url":null,"source":{"id":"https://openalex.org/S4306509340","display_name":"Encyclopedia of Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Encyclopedia of Computer Science","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W1975442866","https://openalex.org/W2036265926","https://openalex.org/W4213201061"],"related_works":["https://openalex.org/W2487751128","https://openalex.org/W7221020287","https://openalex.org/W4312809402","https://openalex.org/W4300588620","https://openalex.org/W2811370865","https://openalex.org/W2277660667","https://openalex.org/W4252916253","https://openalex.org/W4403319160","https://openalex.org/W4233053549","https://openalex.org/W107119796"],"abstract_inverted_index":{"There":[0],"are":[1,73,159,195,214],"many":[2,135],"practical":[3],"computational":[4],"problems":[5,20,26,46,119,136,165],"for":[6,33,44],"which":[7,67],"no":[8],"effective":[9],"computer":[10],"algorithms":[11,43,72,125,141,158,189,213,221],"have":[12],"been":[13],"devised.":[14],"Many":[15],"of":[16,25,50,57,86,97,106,112,115,120,146,153,166],"these":[17,45],"seemingly":[18],"intractable":[19],"belong":[21],"to":[22],"a":[23,36,150,192,204],"class":[24],"known":[27,42],"as":[28,216,222],"NP-complete":[29],"problems.":[30],"NP":[31],"stands":[32],"nondeterministic":[34],"polynomial,":[35],"concept":[37],"discussed":[38],"below.":[39],"The":[40],"only":[41],"require":[47,143],"an":[48,54,98,144],"amount":[49,114,145],"time":[51,76,96,124,128,147,162,172,188,201,212,220],"that":[52,142,148],"is":[53,81,100,149],"exponential":[55,75,123,200,219],"function":[56,152],"the":[58,68,84,89,94,113,154],"problem":[59,69,79,90,155],"size":[60,80,121,167],"(measured":[61],"by":[62,83,140],"some":[63,107],"parameter,":[64],"n,":[65,122,168,173,176],"on":[66],"depends).":[70],"Such":[71],"called":[74,160],"algorithms.":[77,163,202],"Technically,":[78],"measured":[82],"number":[85],"bits":[87],"in":[88,104,197],"description,":[91],"but":[92],"often":[93],"running":[95],"algorithm":[99,209],"more":[101,183],"conveniently":[102],"expressed":[103],"terms":[105],"other":[108],"(roughly":[109],"equivalent)":[110],"measure":[111],"input":[116],"data.":[117],"For":[118,164],"may":[126,170],"take":[127,171],"2n,":[129],"2n1/2,":[130],"3n2,":[131],"etc.":[132,179],"In":[133],"contrast,":[134],"can":[137],"be":[138],"solved":[139],"polynomial":[151,161,187,211],"size.":[156],"These":[157],"they":[169],"n":[174],"log":[175],"n2,":[177],"n3,":[178],"Because":[180],"polynomials":[181],"grow":[182],"slowly":[184],"than":[185],"exponentials,":[186],"(even":[190],"with":[191,199],"large":[193],"exponent)":[194],"efficient":[196],"comparison":[198],"As":[203],"first":[205],"cut":[206],"at":[207],"categorizing":[208],"complexity,":[210],"regarded":[215],"efficient,":[217],"and":[218],"inefficient.":[223]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}