{"id":"https://openalex.org/W2013091420","doi":"https://doi.org/10.1016/s0022-0000(03)00037-0","title":"Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines","display_name":"Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines","publication_year":2003,"publication_date":"2003-05-01","ids":{"openalex":"https://openalex.org/W2013091420","doi":"https://doi.org/10.1016/s0022-0000(03)00037-0","mag":"2013091420"},"language":"en","primary_location":{"id":"doi:10.1016/s0022-0000(03)00037-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(03)00037-0","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","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/A5038094553","display_name":"Martin Sauerhoff","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Sauerhoff","raw_affiliation_strings":["FB Informatik, LS 2, Universitat Dortmund, 44221 Dortmund, Germany","FB Informatik, LS 2, Universitat Dortmund, 44221 Dortmund, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"FB Informatik, LS 2, Universitat Dortmund, 44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"FB Informatik, LS 2, Universitat Dortmund, 44221 Dortmund, Germany#TAB#","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038094553"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":null,"fwci":0.3666,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6008942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"66","issue":"3","first_page":"473","last_page":"495"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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.9997000098228455,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9997000098228455,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8399111032485962},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7679582834243774},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.7592377662658691},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.7093220353126526},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.6562005281448364},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.646752655506134},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.5856409072875977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5852701663970947},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.5784839987754822},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5255576372146606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48882243037223816},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.4875749945640564},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.48139429092407227},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4681430459022522},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.4613608717918396},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4591524004936218},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44975772500038147},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44960054755210876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43128451704978943},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.42638200521469116},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36687368154525757},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3197871446609497},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.15684011578559875}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8399111032485962},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7679582834243774},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.7592377662658691},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.7093220353126526},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.6562005281448364},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.646752655506134},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.5856409072875977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5852701663970947},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.5784839987754822},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5255576372146606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48882243037223816},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4875749945640564},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.48139429092407227},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4681430459022522},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.4613608717918396},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4591524004936218},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44975772500038147},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44960054755210876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43128451704978943},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.42638200521469116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36687368154525757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3197871446609497},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.15684011578559875},{"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0022-0000(03)00037-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(03)00037-0","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8299999833106995,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1482773051","https://openalex.org/W1504650505","https://openalex.org/W1513396692","https://openalex.org/W1523547988","https://openalex.org/W1524205832","https://openalex.org/W1544003261","https://openalex.org/W1600387673","https://openalex.org/W1606189601","https://openalex.org/W1963927532","https://openalex.org/W1985250585","https://openalex.org/W1991547553","https://openalex.org/W2056382040","https://openalex.org/W2063952667","https://openalex.org/W2080267935","https://openalex.org/W2083747727","https://openalex.org/W2088263428","https://openalex.org/W2089797683","https://openalex.org/W2120210041","https://openalex.org/W2120486019","https://openalex.org/W2142151475","https://openalex.org/W2155075753","https://openalex.org/W2177603603","https://openalex.org/W2340787257","https://openalex.org/W2912956481","https://openalex.org/W4249409086"],"related_works":["https://openalex.org/W3205703342","https://openalex.org/W3207919203","https://openalex.org/W4286769568","https://openalex.org/W2168431435","https://openalex.org/W2950005723","https://openalex.org/W4301406156","https://openalex.org/W2134140745","https://openalex.org/W33784398","https://openalex.org/W1553952730","https://openalex.org/W3146512859"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}