Pages that link to "Item:Q1014638"
From MaRDI portal
The following pages link to Affine systems of equations and counting infinitary logic (Q1014638):
Displaying 17 items.
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- Quantum and non-signalling graph isomorphisms (Q2421559) (← links)
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q4625692) (← links)
- RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC! (Q4628673) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- (Q4993594) (← links)
- Definable Inapproximability: New Challenges for Duplicator (Q5079727) (← links)
- (Q5091274) (← links)
- Choiceless Logarithmic Space (Q5092391) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Constructing Hard Examples for Graph Isomorphism (Q5377355) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- Capturing the polynomial hierarchy by second-order revised Krom logic (Q6135775) (← links)
