The following pages link to Computer Science Logic (Q5292635):
Displaying 8 items.
- An extension of fixpoint logic with a symmetry-based choice construct (Q1271477) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- (Q2965470) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Symmetric Circuits for Rank Logic (Q5056365) (← links)
- Choiceless polynomial time with witnessed symmetric choice (Q6649460) (← links)