{"id":"https://openalex.org/W1986934618","doi":"https://doi.org/10.1145/1811129.1811131","title":"On some direct encodings of nondeterministic Turing machines operating in polynomial time into p-complete problems","display_name":"On some direct encodings of nondeterministic Turing machines operating in polynomial time into p-complete problems","publication_year":1974,"publication_date":"1974-01-01","ids":{"openalex":"https://openalex.org/W1986934618","doi":"https://doi.org/10.1145/1811129.1811131","mag":"1986934618"},"language":"en","primary_location":{"id":"doi:10.1145/1811129.1811131","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1811129.1811131","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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/A5048955152","display_name":"Zvi Galil","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zvi Galil","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048955152"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":1.1796,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.75221239,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"6","issue":"1","first_page":"19","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T11567","display_name":"semigroups and automata theory","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/np","display_name":"NP","score":0.7943248152732849},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7850183844566345},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.7193067669868469},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.7163875699043274},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6620543003082275},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6381748914718628},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5530727505683899},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5301578640937805},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.49816131591796875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4459611773490906},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44476330280303955},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.4409751296043396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42051082849502563},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2926425039768219},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2670019865036011},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.13234636187553406},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.05414840579032898}],"concepts":[{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.7943248152732849},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7850183844566345},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.7193067669868469},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.7163875699043274},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6620543003082275},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6381748914718628},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5530727505683899},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5301578640937805},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.49816131591796875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4459611773490906},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44476330280303955},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4409751296043396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42051082849502563},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2926425039768219},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2670019865036011},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.13234636187553406},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.05414840579032898},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1811129.1811131","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1811129.1811131","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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":4,"referenced_works":["https://openalex.org/W1975442866","https://openalex.org/W2007464118","https://openalex.org/W2036265926","https://openalex.org/W4255529553"],"related_works":["https://openalex.org/W1486286946","https://openalex.org/W2122747219","https://openalex.org/W2080505327","https://openalex.org/W2088158977","https://openalex.org/W2949308819","https://openalex.org/W2086059606","https://openalex.org/W2051933114","https://openalex.org/W2134140745","https://openalex.org/W2013091420","https://openalex.org/W4286770094"],"abstract_inverted_index":{"Cook":[0],"[1]":[1],"and":[2,12],"Karp":[3],"[2]":[4],"introduced":[5],"the":[6,31],"notion":[7],"of":[8],"complete":[9],"problems.":[10],"Meyer":[11],"Stockmeyer":[13],"[3]":[14],"showed":[15],"that":[16,35],"some":[17],"problems":[18,24],"require":[19],"exponential":[20],"time.":[21,42],"All":[22],"these":[23],"have":[25],"a":[26],"common":[27],"property":[28],"which":[29],"in":[30,40],"latter":[32],"case":[33],"implies":[34],"they":[36],"cannot":[37],"be":[38],"solved":[39],"polynomial":[41]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}