The computational complexity of module socles
From MaRDI portal
Publication:2120972
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80)
Recommendations
Cites work
- scientific article; zbMATH DE number 1633834 (Why is no real title available?)
- scientific article; zbMATH DE number 107550 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- Computability and randomness
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable abelian groups
- Effective content of field theory
- Effective procedures in field theory
- Ideals in computable rings
- On the complexity of radicals in noncommutative rings
- Recursively enumerable vector spaces
- The complexity of module radicals
- The complexity of radicals and socles of modules
- The computational complexity of torsion-freeness of finitely presented groups
- The decomposability problem for torsion-free abelian groups is analytic-complete
- Turing computability. Theory and applications
This page was built for publication: The computational complexity of module socles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120972)