Definability of linear equation systems over groups and rings
From MaRDI portal
Logic in computer science (03B70) Model theory of finite structures (03C13) Linear equations (linear algebraic aspects) (15A06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Descriptive complexity and finite models (68Q19)
Recommendations
- Definability of linear equation systems over groups and rings
- On the Descriptive Complexity of Linear Algebra
- Descriptive complexity of linear equation systems and applications to propositional proof complexity
- Affine systems of equations and counting infinitary logic
- Affine Systems of Equations and Counting Infinitary Logic
Cited in
(10)- Choiceless polynomial time on structures with small abelian colour classes
- On the Descriptive Complexity of Linear Algebra
- Rank logic is dead, long live rank logic!
- Definability of linear equation systems over groups and rings
- Symmetric circuits for rank logic
- Descriptive complexity of linear equation systems and applications to propositional proof complexity
- Affine Systems of Equations and Counting Infinitary Logic
- Limits of symmetric computation (invited talk)
- Separating rank logic from polynomial time
- Parameterized approximability for modular linear equations
This page was built for publication: Definability of linear equation systems over groups and rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865066)
