{"id":"https://openalex.org/W2087824917","doi":"https://doi.org/10.1137/s0097539796298339","title":"On the Structure of Logspace Probabilistic Complexity Classes","display_name":"On the Structure of Logspace Probabilistic Complexity Classes","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2087824917","doi":"https://doi.org/10.1137/s0097539796298339","mag":"2087824917"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796298339","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796298339","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/A5087302620","display_name":"Ioan I. Macarie","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ioan I. Macarie","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087302620"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4687,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68517835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"3","first_page":"987","last_page":"1007"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7446131706237793},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.7067957520484924},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.661245584487915},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6179371476173401},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5480208992958069},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.545457124710083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5152950286865234},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.5088325142860413},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.503635585308075},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.49045512080192566},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4710792303085327},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46131062507629395},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4554516673088074},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.4391527771949768},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.434059739112854},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.4116725027561188},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.41024094820022583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38503497838974},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3299453854560852},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2118159830570221},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.1240602433681488},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08286422491073608}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7446131706237793},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.7067957520484924},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.661245584487915},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6179371476173401},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5480208992958069},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.545457124710083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5152950286865234},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.5088325142860413},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.503635585308075},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.49045512080192566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4710792303085327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46131062507629395},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4554516673088074},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4391527771949768},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.434059739112854},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.4116725027561188},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.41024094820022583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38503497838974},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3299453854560852},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2118159830570221},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.1240602433681488},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08286422491073608},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":3,"locations":[{"id":"doi:10.1137/s0097539796298339","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796298339","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.51.9796","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.rochester.edu/pub/papers/theory/94.tr506.Structure_of_log_space_probabilistic_complexity_classes.ps.Z","raw_type":"text"},{"id":"pmh:oai:urresearch.rochester.edu:468","is_oa":false,"landing_page_url":"http://hdl.handle.net/1802/617","pdf_url":null,"source":{"id":"https://openalex.org/S4306400518","display_name":"UR Research (University of Rochester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5388228","host_organization_name":"University of Rochester","host_organization_lineage":["https://openalex.org/I5388228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W134387435","https://openalex.org/W186014684","https://openalex.org/W1483468085","https://openalex.org/W1486095079","https://openalex.org/W1521651075","https://openalex.org/W1528588003","https://openalex.org/W1537816921","https://openalex.org/W1590283810","https://openalex.org/W1594498656","https://openalex.org/W1968302689","https://openalex.org/W1970606468","https://openalex.org/W1979381272","https://openalex.org/W1982129592","https://openalex.org/W1985677568","https://openalex.org/W1989382950","https://openalex.org/W1996834809","https://openalex.org/W2000552003","https://openalex.org/W2004471951","https://openalex.org/W2006253309","https://openalex.org/W2009402581","https://openalex.org/W2012539169","https://openalex.org/W2017695758","https://openalex.org/W2019851160","https://openalex.org/W2039391944","https://openalex.org/W2043360684","https://openalex.org/W2048052050","https://openalex.org/W2056352038","https://openalex.org/W2057638793","https://openalex.org/W2059442002","https://openalex.org/W2061631274","https://openalex.org/W2065034429","https://openalex.org/W2069413150","https://openalex.org/W2069535086","https://openalex.org/W2077968161","https://openalex.org/W2082612358","https://openalex.org/W2148957455","https://openalex.org/W2344201262","https://openalex.org/W4239591458"],"related_works":["https://openalex.org/W2070488416","https://openalex.org/W3205703342","https://openalex.org/W3207919203","https://openalex.org/W2168431435","https://openalex.org/W2950005723","https://openalex.org/W4301406156","https://openalex.org/W2057596590","https://openalex.org/W2103947741","https://openalex.org/W2006558104","https://openalex.org/W2087824917"],"abstract_inverted_index":{"We":[0,77],"investigate":[1],"hierarchical":[2],"properties":[3],"and":[4,17,41,80,117,134,137],"logspace":[5,11,22,26,65,90,100],"reductions":[6,62],"of":[7,47,63,73,83,96,109],"languages":[8,53,97,110],"recognized":[9,98,111,121],"by":[10,99,112,122],"probabilistic":[12,23,79,101,133,136],"Turing":[13,102,115],"machines,":[14],"Arthur--Merlin":[15],"games,":[16],"games":[18],"against":[19],"nature":[20],"with":[21,132],"verifiers.":[24],"Each":[25],"complexity":[27,66],"class":[28,67,95,108],"is":[29],"decomposed":[30],"into":[31],"a":[32,55],"hierarchy":[33,49],"based":[34],"on":[35],"corresponding":[36,75],"two-way":[37],"multihead":[38],"finite-state":[39,130],"automata":[40,131],"we":[42,59],"(eventually)":[43],"prove":[44],"the":[45,48],"separation":[46],"levels":[50,72],"(even":[51],"for":[52,92],"over":[54],"single-letter":[56],"alphabet);":[57],"furthermore,":[58],"show":[60],"efficient":[61],"each":[64],"to,":[68],"or":[69],"between,":[70],"low":[71],"its":[74],"hierarchy.":[76],"find":[78],"probabilistic-plus-nondeterministic":[81],"variants":[82],"Savitch's":[84],"maze":[85],"threading":[86],"problem":[87],"which":[88,118],"are":[89],"complete":[91],"PL":[93],"(the":[94,107],"machines)":[103],"and,":[104],"respectively,":[105],"PPP":[106],"polynomial-time":[113],"deterministic":[114],"machines),":[116],"can":[119],"be":[120],"one-way":[123,127],"non-sensing":[124],"two-head":[125],"(or":[126],"one-head":[128],"one-counter)":[129],"both":[135],"nondeterministic":[138],"states,":[139],"respectively.":[140]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}