Recommendations
Cites work
- Affine systems of equations and counting infinitary logic
- An optimal lower bound on the number of variables for graph identification
- Characterising choiceless polynomial time with first-order interpretations
- Choiceless computation and symmetry
- Choiceless polynomial time
- Choiceless polynomial time on structures with small abelian colour classes
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Finite model theory and its applications.
- scientific article; zbMATH DE number 515737 (Why is no real title available?)
- scientific article; zbMATH DE number 1487500 (Why is no real title available?)
- Is polynomial time choiceless?
- L-recursion and a new logic for logarithmic space
- Languages that Capture Complexity Classes
- Rank logic is dead, long live rank logic!
- Structure and complexity of relational queries
- Undirected connectivity in log-space
Cited in
(4)
This page was built for publication: Choiceless Logarithmic Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092391)
