{"id":"https://openalex.org/W1987444582","doi":"https://doi.org/10.1137/0210057","title":"Limitations on Separating Nondeterministic Complexity Classes","display_name":"Limitations on Separating Nondeterministic Complexity Classes","publication_year":1981,"publication_date":"1981-11-01","ids":{"openalex":"https://openalex.org/W1987444582","doi":"https://doi.org/10.1137/0210057","mag":"1987444582"},"language":"en","primary_location":{"id":"doi:10.1137/0210057","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210057","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/A5071766529","display_name":"Charles Rackoff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Charles W. Rackoff","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5009639694","display_name":"Joel Seiferas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joel I. Seiferas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.11247357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"4","first_page":"742","last_page":"745"},"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.9995999932289124,"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.9995999932289124,"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.9980999827384949,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8991751074790955},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6123365759849548},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5677337050437927},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5647994875907898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5408639311790466},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5275841951370239},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.48412665724754333},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47480905055999756},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.47207188606262207},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4493159353733063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4292333424091339},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35744595527648926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30387765169143677},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.2285100519657135}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8991751074790955},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6123365759849548},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5677337050437927},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5647994875907898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5408639311790466},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5275841951370239},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.48412665724754333},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47480905055999756},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.47207188606262207},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4493159353733063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4292333424091339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35744595527648926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30387765169143677},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2285100519657135},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0210057","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210057","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1982129592","https://openalex.org/W1993138363","https://openalex.org/W1996834809","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2122747219","https://openalex.org/W2095274905","https://openalex.org/W1486286946","https://openalex.org/W4288351008","https://openalex.org/W2018964411","https://openalex.org/W2949308819","https://openalex.org/W70814323","https://openalex.org/W3033897917","https://openalex.org/W2026191634","https://openalex.org/W2144557478"],"abstract_inverted_index":{"If":[0],"the":[1,15],"time":[2],"bounds":[3],"defining":[4],"two":[5,16],"nondeterministic":[6],"complexity":[7],"classes":[8],"are":[9,21],"too":[10,23],"close":[11,24],"for":[12,25,36],"separation":[13,26],"by":[14,27],"known":[17],"techniques,":[18],"then":[19],"they":[20],"almost":[22],"any":[28],"relativizable":[29],"technique.":[30],"Proof":[31],"of":[32],"an":[33],"analogous":[34],"result":[35],"space":[37],"would":[38],"be":[39],"a":[40],"major":[41],"breakthrough,":[42],"implying":[43],"$\\operatorname{NSPACE}(\\log":[44],"n)":[45],"=":[46],"\\operatorname{DSPACE}(\\log":[47],"n)$.":[48]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}