{"id":"https://openalex.org/W2049688961","doi":"https://doi.org/10.1137/0219034","title":"Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones","display_name":"Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones","publication_year":1990,"publication_date":"1990-06-01","ids":{"openalex":"https://openalex.org/W2049688961","doi":"https://doi.org/10.1137/0219034","mag":"2049688961"},"language":"en","primary_location":{"id":"doi:10.1137/0219034","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219034","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/A5001544783","display_name":"Maciej Li\u015bkiewicz","orcid":"https://orcid.org/0000-0003-0059-5086"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Maciej Li\u015bkiewicz","raw_affiliation_strings":["Wroclaw Univ., Wroclaw, Poland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wroclaw Univ., Wroclaw, Poland#TAB#","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019738192","display_name":"Krzysztof Lory\u015b","orcid":"https://orcid.org/0000-0002-3553-3443"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Krzysztof Lory\u015b","raw_affiliation_strings":["Wroclaw Univ., Wroclaw, Poland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wroclaw Univ., Wroclaw, Poland#TAB#","institution_ids":["https://openalex.org/I219388962"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":0.4945,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.63151548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"19","issue":"3","first_page":"511","last_page":"521"},"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/T12162","display_name":"Cellular Automata and Applications","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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9986000061035156,"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/turing-machine","display_name":"Turing machine","score":0.7581825256347656},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7476942539215088},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.7083370685577393},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6644301414489746},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.6275204420089722},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.6184228658676147},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.6038638353347778},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5877875685691833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.513931930065155},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46956920623779297},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.4280587434768677},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.427667498588562},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4250723719596863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3773519992828369},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.31629645824432373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31022340059280396},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.19441065192222595},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08629000186920166},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.06322401762008667}],"concepts":[{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7581825256347656},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7476942539215088},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.7083370685577393},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6644301414489746},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.6275204420089722},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.6184228658676147},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.6038638353347778},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5877875685691833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.513931930065155},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46956920623779297},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.4280587434768677},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.427667498588562},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4250723719596863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3773519992828369},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31629645824432373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31022340059280396},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.19441065192222595},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08629000186920166},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.06322401762008667}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0219034","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219034","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":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320325350","display_name":"Henan Institute of Science and Technology","ror":"https://ror.org/0578f1k82"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1963576748","https://openalex.org/W1978015099","https://openalex.org/W1980572240","https://openalex.org/W1984849808","https://openalex.org/W2045398663","https://openalex.org/W2050000128","https://openalex.org/W2062934582","https://openalex.org/W2087801547","https://openalex.org/W2125495920"],"related_works":["https://openalex.org/W2080505327","https://openalex.org/W2070488416","https://openalex.org/W1531426191","https://openalex.org/W21360042","https://openalex.org/W1982159199","https://openalex.org/W1960332849","https://openalex.org/W1555195996","https://openalex.org/W2037124586","https://openalex.org/W2022693656","https://openalex.org/W3205703342"],"abstract_inverted_index":{"Every":[0],"single-tape":[1,16],"Turing":[2],"machine":[3],"(TM)":[4],"of":[5,29,40,49],"time":[6,28],"complexity":[7],"$T(n)":[8],"\\geqq":[9],"n^{2}$":[10],"can":[11,32],"be":[12,33],"simulated":[13],"by":[14,35,44],"a":[15],"TM":[17],"in":[18,37,46],"space":[19],"$T^{{1":[20],"/":[21],"2}}(n)$.":[22],"It":[23],"is":[24],"shown":[25,55],"that":[26],"the":[27,30,38,47],"simulation":[31],"bounded":[34],"$T^{3/2}(n)$":[36],"case":[39,48],"deterministic":[41],"TMs":[42],"and":[43,59],"$T(n)$":[45],"nondeterministic":[50],"ones.":[51],"Similar":[52],"results":[53],"are":[54],"for":[56,60],"off-line":[57],"machines":[58,61],"with":[62],"multidimensional":[63],"tape.":[64]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}