Pages that link to "Item:Q4779654"
From MaRDI portal
The following pages link to On polynomial time computation over unordered structures (Q4779654):
Displaying 24 items.
- Can abstract state machines be useful in language theory? (Q880169) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- Choiceless polynomial time (Q1125059) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- Structures computable in polynomial time. I (Q2401536) (← 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)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← 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)
- On fixed-point logic with counting (Q4508261) (← links)
- (Q5013888) (← links)
- (Q5091274) (← links)
- (Q5227514) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- Access structures determined by uniform polymatroids (Q6085192) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
- Choiceless polynomial time with witnessed symmetric choice (Q6649460) (← links)
