Pages that link to "Item:Q2478545"
From MaRDI portal
The following pages link to Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545):
Displaying 10 items.
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- Database Theory, Yuri, and Me (Q3585996) (← links)
- Choiceless Computation and Symmetry (Q3586021) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- Choiceless Logarithmic Space (Q5092391) (← links)
