{"id":"https://openalex.org/W2088141885","doi":"https://doi.org/10.1137/0206054","title":"On Relating Time and Space to Size and Depth","display_name":"On Relating Time and Space to Size and Depth","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W2088141885","doi":"https://doi.org/10.1137/0206054","mag":"2088141885"},"language":"en","primary_location":{"id":"doi:10.1137/0206054","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206054","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/A5109583026","display_name":"Allan Borodin","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Allan Borodin","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 1A7"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 1A7","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109583026"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":7.0779,"has_fulltext":false,"cited_by_count":341,"citation_normalized_percentile":{"value":0.97782964,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"6","issue":"4","first_page":"733","last_page":"744"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9990000128746033,"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.9990000128746033,"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.9923999905586243,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9692999720573425,"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/turing-machine","display_name":"Turing machine","score":0.8904699683189392},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.7371164560317993},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.736641526222229},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.7111614346504211},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.7075908184051514},{"id":"https://openalex.org/keywords/turing-machine-examples","display_name":"Turing machine examples","score":0.6395280957221985},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.61893630027771},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6172821521759033},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.6084280014038086},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5947763323783875},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5925636887550354},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5871455669403076},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.5516692399978638},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5408179759979248},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4811097979545593},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46964213252067566},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4551531970500946},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.41062265634536743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3489856719970703},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32183974981307983},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.14073395729064941},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07631009817123413},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06210741400718689},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.0540710985660553}],"concepts":[{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.8904699683189392},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.7371164560317993},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.736641526222229},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.7111614346504211},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.7075908184051514},{"id":"https://openalex.org/C21176728","wikidata":"https://www.wikidata.org/wiki/Q7854963","display_name":"Turing machine examples","level":5,"score":0.6395280957221985},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.61893630027771},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6172821521759033},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.6084280014038086},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5947763323783875},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5925636887550354},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5871455669403076},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.5516692399978638},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5408179759979248},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4811097979545593},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46964213252067566},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4551531970500946},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.41062265634536743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3489856719970703},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32183974981307983},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.14073395729064941},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07631009817123413},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06210741400718689},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0540710985660553},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0206054","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206054","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.394.1059","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.1059","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~bor/Papers/relating-time-space-size-depth.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1551631489","https://openalex.org/W1976626676","https://openalex.org/W1979469777","https://openalex.org/W1982129592","https://openalex.org/W1982704699","https://openalex.org/W1995502606","https://openalex.org/W2014963708","https://openalex.org/W2026191634","https://openalex.org/W2088300760","https://openalex.org/W2088956149","https://openalex.org/W2121663287","https://openalex.org/W2122786581","https://openalex.org/W2130566259","https://openalex.org/W2138170131","https://openalex.org/W2140232587","https://openalex.org/W2545919726","https://openalex.org/W2592184324"],"related_works":["https://openalex.org/W1662868588","https://openalex.org/W2547364878","https://openalex.org/W2348596562","https://openalex.org/W4313546668","https://openalex.org/W2070488416","https://openalex.org/W2059442002","https://openalex.org/W3211509423","https://openalex.org/W3205703342","https://openalex.org/W1598776769","https://openalex.org/W3207919203"],"abstract_inverted_index":{"Turing":[0,17,37,51],"machine":[1,18,38,52],"space":[2],"complexity":[3,53],"is":[4],"related":[5,29],"to":[6,26,46],"circuit":[7,21,40],"depth":[8],"complexity.":[9,41,56],"The":[10],"relationship":[11],"complements":[12],"the":[13,28],"known":[14],"connection":[15,49],"between":[16,50],"time":[19],"and":[20,39,54],"size,":[22],"thus":[23],"enabling":[24],"us":[25],"expose":[27],"nature":[30],"of":[31],"some":[32,48],"important":[33],"open":[34],"problems":[35],"concerning":[36],"We":[42],"are":[43],"also":[44],"able":[45],"show":[47],"arithmetic":[55]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}