{"id":"https://openalex.org/W2066080128","doi":"https://doi.org/10.1137/0220031","title":"Nondeterministic Computations in Sublogarithmic Space and Space Constructibility","display_name":"Nondeterministic Computations in Sublogarithmic Space and Space Constructibility","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W2066080128","doi":"https://doi.org/10.1137/0220031","mag":"2066080128"},"language":"en","primary_location":{"id":"doi:10.1137/0220031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220031","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/A5065408637","display_name":"Viliam Geffert","orcid":"https://orcid.org/0000-0001-9143-1479"},"institutions":[{"id":"https://openalex.org/I204881574","display_name":"University of Pavol Jozef \u0160af\u00e1rik","ror":"https://ror.org/039965637","country_code":"SK","type":"education","lineage":["https://openalex.org/I204881574"]}],"countries":["SK"],"is_corresponding":true,"raw_author_name":"Viliam Geffert","raw_affiliation_strings":["Dept. of Computer Science, Univ. of P.J.\u0160af\u00e1rik, Ko\u0161ice, Czechoslovakia"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Univ. of P.J.\u0160af\u00e1rik, Ko\u0161ice, Czechoslovakia","institution_ids":["https://openalex.org/I204881574"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065408637"],"corresponding_institution_ids":["https://openalex.org/I204881574"],"apc_list":null,"apc_paid":null,"fwci":4.9666,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.96337286,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"3","first_page":"484","last_page":"498"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9944999814033508,"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.9944999814033508,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9707000255584717,"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.9011973738670349},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6493033170700073},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5748348832130432},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5557180047035217},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5497336387634277},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.5475432276725769},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5303759574890137},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5213955044746399},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4656670093536377},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45565083622932434},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.45408371090888977},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.44839417934417725},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.41248902678489685},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39348357915878296},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3146030902862549},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24286386370658875}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.9011973738670349},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6493033170700073},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5748348832130432},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5557180047035217},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5497336387634277},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.5475432276725769},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5303759574890137},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5213955044746399},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4656670093536377},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45565083622932434},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.45408371090888977},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.44839417934417725},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.41248902678489685},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39348357915878296},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3146030902862549},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24286386370658875},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220031","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W956032893","https://openalex.org/W1590283810","https://openalex.org/W1975698236","https://openalex.org/W1982129592","https://openalex.org/W2018428770","https://openalex.org/W2043360684","https://openalex.org/W2061378925","https://openalex.org/W2592184324","https://openalex.org/W4234407168"],"related_works":["https://openalex.org/W2122747219","https://openalex.org/W1981385397","https://openalex.org/W4387774848","https://openalex.org/W4388215614","https://openalex.org/W2089690927","https://openalex.org/W2189193453","https://openalex.org/W2051933114","https://openalex.org/W2184601028","https://openalex.org/W1500655838","https://openalex.org/W2144345645"],"abstract_inverted_index":{"The":[0],"open":[1],"problem":[2],"of":[3,42,87,98],"nondeterministic":[4,49,77,117],"space":[5,23,40,50,74],"constructibility":[6,41],"for":[7,55],"sublogarithmic":[8],"functions":[9,25,62],"is":[10,13,82],"resolved.":[11],"It":[12],"shown":[14],"that":[15,27],"there":[16],"are":[17,72],"no":[18],"unbounded":[19],"monotone":[20,43],"increasing":[21],"nondeterministically":[22],"constructible":[24,75],"such":[26],"$\\sup":[28],"_{n":[29],"\\to":[30,90],"\\infty":[31],"}":[32],"s(n)":[33],"/":[34],"\\log":[35,65],"(n)":[36],"=":[37],"0$.":[38],"Consequently,":[39],"functionscannot":[44],"be":[45],"used":[46],"to":[47,115],"separate":[48],"from":[51],"deterministic":[52],"space,":[53],"even":[54],"a":[56],"very":[57],"low-level":[58],"complexity":[59],"range,":[60],"since":[61],"like":[63],"$\\log":[64],"(n)$":[66],"and":[67,109],",$\\sqrt":[68],"{\\log":[69],"(n)}":[70],"$":[71],"not":[73],"by":[76,84],"Turing":[78],"machines.":[79],"This":[80],"result":[81],"obtained":[83],"the":[85,88,116],"extension":[86],"$n":[89],"n":[91],"+":[92],"n!$":[93],"method,":[94],"described":[95],"in":[96],"[Hierarchies":[97],"memory":[99],"limited":[100],"computations,":[101],"IEEE":[102],"Conference":[103],"Record":[104],"on":[105],"Switching":[106],"Circuit":[107],"Theory":[108],"Logical":[110],"Design,":[111],"1965,":[112],"pp.":[113],"179\u2013190],":[114],"case.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}