{"id":"https://openalex.org/W1995246641","doi":"https://doi.org/10.1137/0203021","title":"Computationally Related Problems","display_name":"Computationally Related Problems","publication_year":1974,"publication_date":"1974-12-01","ids":{"openalex":"https://openalex.org/W1995246641","doi":"https://doi.org/10.1137/0203021","mag":"1995246641"},"language":"en","primary_location":{"id":"doi:10.1137/0203021","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203021","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/A5070824596","display_name":"Sartaj Sahni","orcid":"https://orcid.org/0000-0002-8129-1676"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"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":"Sartaj Sahni","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca. New York","Department of Computer, Information, and Control Sciences, University of Minnesota, Minneapolis, Minnesota 55455. 262"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca. New York","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Department of Computer, Information, and Control Sciences, University of Minnesota, Minneapolis, Minnesota 55455. 262","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070824596"],"corresponding_institution_ids":["https://openalex.org/I130238516","https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":5.5182,"has_fulltext":false,"cited_by_count":364,"citation_normalized_percentile":{"value":0.96771037,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"3","issue":"4","first_page":"262","last_page":"279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.998199999332428,"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.998199999332428,"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.9959999918937683,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.7019054889678955},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6162614822387695},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6015665531158447},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5634748339653015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5452646613121033},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5188276171684265},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.48136264085769653},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.47993117570877075},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.4571636915206909},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4293564558029175},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3354875445365906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32015731930732727},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.22675821185112},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17098936438560486},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09700611233711243}],"concepts":[{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.7019054889678955},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6162614822387695},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6015665531158447},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5634748339653015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5452646613121033},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5188276171684265},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.48136264085769653},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47993117570877075},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.4571636915206909},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4293564558029175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3354875445365906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32015731930732727},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.22675821185112},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17098936438560486},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09700611233711243},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0203021","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203021","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.145.8685","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.8685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cise.ufl.edu/~sahni/papers/comp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1982077569","https://openalex.org/W2014355235","https://openalex.org/W2021686582","https://openalex.org/W2076447414","https://openalex.org/W2160645305","https://openalex.org/W2401610261","https://openalex.org/W2592184324","https://openalex.org/W2800875754","https://openalex.org/W2989713547","https://openalex.org/W3021014091"],"related_works":["https://openalex.org/W2122747219","https://openalex.org/W1486286946","https://openalex.org/W4387774848","https://openalex.org/W1553952730","https://openalex.org/W2144557478","https://openalex.org/W1483438220","https://openalex.org/W2109807377","https://openalex.org/W2000805093","https://openalex.org/W2020831804","https://openalex.org/W2415632638"],"abstract_inverted_index":{"We":[0],"look":[1],"at":[2],"several":[3],"problems":[4,34,54,58,64,100,136],"from":[5],"areas":[6],"such":[7],"as":[8,66,87],"network":[9],"flows,":[10],"game":[11],"theory,":[12,16],"artificial":[13],"intelligence,":[14],"graph":[15],"integer":[17],"programming":[18,21],"and":[19,22],"nonlinear":[20],"show":[23],"that":[24,29,88,102,128,137],"they":[25],"are":[26,108],"related":[27,97],"in":[28,37,101,141],"any":[30],"one":[31],"of":[32,63,70,75,106,122,135],"these":[33,53,103],"is":[35,55,84,96],"solvable":[36],"polynomial":[38,49,79,91,117,143],"time":[39,50,80,92],"if":[40,111],"all":[41],"the":[42,60,73,85,109],"others":[43],"are,":[44],"too.":[45],"At":[46],"present,":[47],"no":[48],"algorithm":[51],"for":[52],"known.":[56],"These":[57],"extend":[59],"equivalence":[61,130],"class":[62,74,131,134],"known":[65],"P-Complete.":[67],"The":[68],"problem":[69,114],"deciding":[71],"whether":[72],"languages":[76,107],"accepted":[77,89],"by":[78,90],"nondeterministic":[81],"Turing":[82,94],"machines":[83,95],"same":[86,110],"deterministic":[93,118,142],"to":[98],"P-Complete":[99,113],"two":[104],"classes":[105],"each":[112],"has":[115],"a":[116,133],"solution.":[119],"In":[120],"view":[121],"this,":[123],"it":[124],"appears":[125],"very":[126],"likely":[127],"this":[129],"defines":[132],"cannot":[138],"be":[139],"solved":[140],"time.":[144]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":19},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":12}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}