scientific article; zbMATH DE number 2072707
From MaRDI portal
Publication:4467933
universal enveloping algebramaximal idealCramer's rulemodular simple Lie algebra of type \(B\)P \(\neq\) NP
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Modular Lie (super)algebras (17B50)
Recommendations
- Linear algebra in \({\mathbb R^n}\). Theory, algorithms and complexity
- Computability in linear algebra
- scientific article; zbMATH DE number 3936517
- scientific article; zbMATH DE number 1418992
- The computational complexity of some problems of linear algebra
- The proof complexity of linear algebra
- Complexity theory of numerical linear algebra
- Some Algorithmic Problems for Lie Algebras
- Computational and Algorithmic Linear Algebra and n-Dimensional Geometry
- The computational complexity of some problems of linear algebra (extended abstract)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4467933)