The following pages link to (Q4332930):
Displaying 4 items.
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
