{"id":"https://openalex.org/W2064577184","doi":"https://doi.org/10.1145/800119.803883","title":"Complete problems for deterministic polynomial time","display_name":"Complete problems for deterministic polynomial time","publication_year":1974,"publication_date":"1974-01-01","ids":{"openalex":"https://openalex.org/W2064577184","doi":"https://doi.org/10.1145/800119.803883","mag":"2064577184"},"language":"en","primary_location":{"id":"doi:10.1145/800119.803883","doi":"https://doi.org/10.1145/800119.803883","is_oa":false,"landing_page_url":"https://doi.org/10.1145/800119.803883","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5103363705","display_name":"Neil Deaton Jones","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil D. Jones","raw_affiliation_strings":["","Computer Science Department, University of Kansas, Lawrence, KS 66045, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"Computer Science Department, University of Kansas, Lawrence, KS 66045, U.S.A","institution_ids":["https://openalex.org/I146416000"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060032448","display_name":"William T. Laaser","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William T. Laaser","raw_affiliation_strings":["","Computer Science Department, University of Kansas, Lawrence, KS 66045, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"Computer Science Department, University of Kansas, Lawrence, KS 66045, U.S.A","institution_ids":["https://openalex.org/I146416000"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I146416000"],"apc_list":null,"apc_paid":null,"fwci":5.0657,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.96644295,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"40","last_page":"46"},"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.9340999722480774,"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.9340999722480774,"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.05869999900460243,"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/T11567","display_name":"semigroups and automata theory","score":0.0026000000070780516,"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/complete-problems","display_name":"complete problems","score":0.9409999847412109},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.7070000171661377},{"id":"https://openalex.org/keywords/p-versus-np","display_name":"P versus NP","score":0.6190000176429749},{"id":"https://openalex.org/keywords/satisfiability","display_name":"satisfiability","score":0.5170000195503235},{"id":"https://openalex.org/keywords/combinatorial-problems","display_name":"combinatorial problems","score":0.6190000176429749},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.5490000247955322}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.56581050157547},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5530472993850708},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.458334743976593},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3612721264362335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34507423639297485},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.059890300035476685}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/800119.803883","doi":"https://doi.org/10.1145/800119.803883","is_oa":false,"landing_page_url":"https://doi.org/10.1145/800119.803883","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1530765221","https://openalex.org/W1768003599","https://openalex.org/W1817451992","https://openalex.org/W1989887898","https://openalex.org/W1998084650","https://openalex.org/W2036265926","https://openalex.org/W2036427735","https://openalex.org/W2048343898"],"related_works":["https://openalex.org/W1995246641","https://openalex.org/W1986934618","https://openalex.org/W2052581866","https://openalex.org/W7095626430","https://openalex.org/W7095499214","https://openalex.org/W7098173059","https://openalex.org/W7098318000","https://openalex.org/W2033331856","https://openalex.org/W1968653910","https://openalex.org/W4410860631"],"abstract_inverted_index":{"The":[0],"results":[1],"of":[2,50,64,77,87,96,104],"Cook":[3],"and":[4,32,90],"Karp":[5],"([K],":[6],"[C])":[7],"aroused":[8],"considerable":[9],"interest":[10],"for":[11,67],"at":[12],"least":[13],"two":[14],"reasons.":[15],"First,":[16],"the":[17,62],"answer":[18],"to":[19,28,42,46,72],"a":[20,80,83,97,105],"long-standing":[21],"open":[22],"question":[23,81],"which":[24],"had":[25],"seemed":[26],"peculiar":[27],"automata":[29],"theory\u2014whether":[30],"deterministic":[31],"nondeterministic":[33],"polynomial-time-bounded":[34],"Turing":[35],"machines":[36],"are":[37],"equivalent":[38,45],"in":[39,110],"power\u2014was":[40],"seen":[41],"be":[43,56,108],"exactly":[44],"determining":[47],"whether":[48],"any":[49],"several":[51],"familiar":[52],"combinatorial":[53,89],"problems":[54,66,92],"can":[55,102],"solved":[57],"by":[58,79],"polynomial-time":[59],"algorithms.":[60],"Second,":[61],"existence":[63],"complete":[65],"NP1":[68],"made":[69],"it":[70],"possible":[71],"replace":[73],"an":[74],"entire":[75],"class":[76],"questions":[78],"about":[82],"single":[84,98],"representative.Thus":[85],"all":[86],"these":[88],"automata-theoretic":[91],"were":[93],"essentially":[94],"restatements":[95],"problem,":[99],"such":[100],"as:":[101],"satisfiability":[103],"propositional":[106],"formula":[107],"decided":[109],"polynomial":[111],"time.":[112]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}