{"id":"https://openalex.org/W7096939628","doi":null,"title":"Inductive Counting below LOGSPACE","display_name":"Inductive Counting below LOGSPACE","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7096939628"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.1705","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.1705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.informatik.uni-trier.de/pub/reports/94-12.ps","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7096939628"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mathematik Informatik","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mathematik Informatik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5153189134","display_name":"Trierer Forschungsberichte","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trierer Forschungsberichte","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Fachbereich Iv","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fachbereich Iv","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Damm","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Damm","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066480163","display_name":"Carsten Damm","orcid":"https://orcid.org/0000-0002-7653-2498","observed_orcids":["https://orcid.org/0000-0002-7653-2498"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carsten Damm","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014","observed_orcids":["https://orcid.org/0000-0003-4224-4014"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Markus Holzer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.5971999764442444,"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.5971999764442444,"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.27880001068115234,"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.05790000036358833,"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/complementation","display_name":"complementation","score":0.8999999761581421},{"id":"https://openalex.org/keywords/hierarchy-collapse","display_name":"hierarchy collapse","score":0.8159999847412109},{"id":"https://openalex.org/keywords/logspace","display_name":"logspace","score":0.5019999742507935}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8633000254631042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7008000016212463},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.6621000170707703},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6419000029563904},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5751000046730042},{"id":"https://openalex.org/C26826806","wikidata":"https://www.wikidata.org/wiki/Q438358","display_name":"Alternation (linguistics)","level":2,"score":0.5677000284194946},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5544000267982483},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5543000102043152},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5422000288963318},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.48820000886917114},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48330000042915344},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.47380000352859497},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.40400001406669617},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.39579999446868896},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.260699987411499},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.1705","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.1705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.informatik.uni-trier.de/pub/reports/94-12.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2014483498","https://openalex.org/W1576876802","https://openalex.org/W2109237512","https://openalex.org/W2071260871","https://openalex.org/W243027042","https://openalex.org/W2055505053","https://openalex.org/W1968785579","https://openalex.org/W2044713592","https://openalex.org/W2061378925","https://openalex.org/W2128428740"],"abstract_inverted_index":{"We":[0,54],"apply":[1],"inductive":[2],"counting":[3],"to":[4,73,89,105],"nondeterministic":[5,44],"branching":[6,24],"programs":[7,25],"and":[8,86,144],"prove":[9],"that":[10,30,61,121,149],"complementation":[11],"on":[12],"this":[13],"model":[14],"can":[15],"be":[16],"done":[17],"without":[18],"increasing":[19],"the":[20,23,37,62,79,97,106,109,123,126],"width":[21],"of":[22,39,65,83,92],"too":[26],"much.":[27],"This":[28,77,100],"shows":[29],"for":[31,56,133,150],"an":[32],"arbitrary":[33,57],"space":[34,46,58,68,90,128,135],"bound":[35],"s(n),":[36],"class":[38],"languages":[40],"accepted":[41],"by":[42],"nonuniform":[43,66,98],"O(s(n))":[45,67],"bounded":[47,69],"Turing":[48,70],"machines":[49,71],"is":[50,147],"closed":[51],"under":[52],"complementation.":[53],"obtain":[55],"bounds":[59,91,136],"s(n)":[60],"alternation":[63],"hierarchy":[64,129],"collapses":[72],"its":[74],"first":[75],"level.":[76],"improves":[78],"previously":[80],"known":[81],"result":[82],"Immerman":[84],"[6]":[85,143],"Szelepcs'enyi":[87],"[12]":[88,145],"order":[93],"o(log":[94],"n)":[95],"in":[96,122],"setting.":[99],"reveals":[101],"a":[102],"strong":[103],"difference":[104],"relations":[107],"between":[108],"corresponding":[110],"uniform":[111,124],"complexity":[112],"classes,":[113],"since":[114],"very":[115],"recently":[116],"it":[117,146],"has":[118],"been":[119],"proved":[120,148],"case":[125],"alternating":[127],"does":[130],"not":[131],"collapse":[132],"sublogarithmic":[134],"[3,":[137],"5,":[138],"8].":[139],"1":[140],"Introduction":[141],"In":[142],"spa...":[151]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7096939628","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}
