The computational complexity of module socles
From MaRDI portal
Publication:2120972
DOI10.1016/j.apal.2022.103089OpenAlexW4206756892MaRDI QIDQ2120972
Publication date: 1 April 2022
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2022.103089
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Applications of computability and recursion theory (03D80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of module radicals
- The complexity of radicals and socles of modules
- Ideals in computable rings
- On the complexity of radicals in noncommutative rings
- COMPUTABLE ABELIAN GROUPS
- Turing Computability
- Effective procedures in field theory
- Effective content of field theory
- Recursively enumerable vector spaces
- The computational complexity of torsion-freeness of finitely presented groups
- The decomposability problem for torsion-free abelian groups is analytic-complete
- Computable Algebra, General Theory and Theory of Computable Fields