The following pages link to Choiceless polynomial time (Q1125059):
Displayed 24 items.
- Can abstract state machines be useful in language theory? (Q880169) (← links)
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) (Q1683704) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- 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)
- Semantic essence of AsmL (Q2571205) (← 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)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- Database Theory, Yuri, and Me (Q3585996) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Choiceless Computation and Symmetry (Q3586021) (← links)
- Fixed-Point Definability and Polynomial Time (Q3644737) (← links)
- Strong extension axioms and Shelah's zero-one law for choiceless polynomial time (Q4457727) (← links)
- On polynomial time computation over unordered structures (Q4779654) (← links)
- (Q5013888) (← links)
- (Q5079746) (← links)
- Choiceless Logarithmic Space (Q5092391) (← links)
- (Q5227514) (← links)
- Why Sets? (Q5452179) (← links)
- Abstract State Machines with Exact Real Arithmetic (Q5881448) (← links)
- Addendum to ``Choiceless polynomial time'' (Q5945399) (← links)