{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T12:07:15Z","timestamp":1762344435841,"version":"build-2065373602"},"reference-count":10,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.435.7","type":"journal-article","created":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:08:07Z","timestamp":1762016887000},"page":"81-91","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints"],"prefix":"10.4204","volume":"435","author":[{"given":"Florian","family":"Bruse","sequence":"first","affiliation":[{"name":"University of Kassel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kronenberger","sequence":"additional","affiliation":[{"name":"University of Kassel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Lange","sequence":"additional","affiliation":[{"name":"University of Kassel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2720","published-online":{"date-parts":[[2025,11,4]]},"reference":[{"issue":"2","key":"Ab-Vi","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1006\/JCSS.1995.1025","article-title":"Computing with First-Order Logic","volume":"50","author":"Abiteboul","year":"1995","journal-title":"J. Comput. Syst. Sci."},{"key":"DBLP:journals\/corr\/abs-2209-10311","series-title":"EPTCS","doi-asserted-by":"publisher","first-page":"17","DOI":"10.4204\/EPTCS.370.2","article-title":"Capturing Bisimulation-Invariant Exponential-Time Complexity Classes","volume-title":"Proc. 13th Int. Symp. on Games, Automata, Logics and Formal Verification, GandALF 2022","volume":"370","author":"Bruse","year":"2022"},{"key":"Fagin74","first-page":"43","article-title":"Generalized First-Order Spectra and Polynomial-Time Recognizable Sets","volume":"7","author":"Fagin","year":"1974","journal-title":"Complexity and Computation"},{"key":"FREIRE201171","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.entcs.2011.03.006","article-title":"The Descriptive Complexity of the Deterministic Exponential Time Hierarchy","volume-title":"Proc. 5th Workshop on Logical and Semantic Frameworks with Applications, LSFA'10","volume":"269","author":"Freire","year":"2011"},{"key":"DBLP:journals\/iandc\/Immerman86","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational Queries Computable in Polynomial Time","volume":"68","author":"Immerman","year":"1986","journal-title":"Information and Control"},{"issue":"4","key":"Imm:lanccc","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages That Capture Complexity Classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM Journal of Computing"},{"volume-title":"Capturing Bisimulation-Invariant Complexity Classes by Polyadic Higher-Order Fixpoint Logic","year":"2018","author":"Kronenberger","key":"KronenbergerMSc19"},{"key":"Otto99","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00314-4","article-title":"Bisimulation-invariant PTIME and higher-dimensional \u03bc-calculus","volume":"224","author":"Otto","year":"1999","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"Stockmeyer:1976:PH","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"TCS"},{"key":"DBLP:conf\/stoc\/Vardi82","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/800070","article-title":"The Complexity of Relational Query Languages (Extended Abstract)","volume-title":"Proc. 14th Symp. on Theory of Computing, STOC'82","author":"Vardi","year":"1982"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T12:01:22Z","timestamp":1762344082000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2511.02596v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,4]]},"references-count":10,"URL":"https:\/\/doi.org\/10.4204\/eptcs.435.7","relation":{},"ISSN":["2075-2180"],"issn-type":[{"type":"electronic","value":"2075-2180"}],"subject":[],"published":{"date-parts":[[2025,11,4]]}}}