Choiceless Logarithmic Space
From MaRDI portal
Publication:5092391
DOI10.4230/LIPIcs.MFCS.2019.31OpenAlexW2970311880MaRDI QIDQ5092391
Svenja Schalthöfer, Erich Grädel
Publication date: 21 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10975/pdf/LIPIcs-MFCS-2019-31.pdf/
Cites Work
- Unnamed Item
- Unnamed Item
- Finite model theory and its applications.
- Affine systems of equations and counting infinitary logic
- Choiceless polynomial time
- An optimal lower bound on the number of variables for graph identification
- Structure and complexity of relational queries
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
- L-Recursion and a new Logic for Logarithmic Space
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
- Is Polynomial Time Choiceless?
- Choiceless Computation and Symmetry
- Undirected connectivity in log-space
- Languages that Capture Complexity Classes
- RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!
- Characterising Choiceless Polynomial Time with First-Order Interpretations
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
This page was built for publication: Choiceless Logarithmic Space
