The computational complexity of module socles (Q2120972): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.apal.2022.103089
+Normal rank
@@ Property / OpenAlex ID @@
+W4206756892
@@ Property / OpenAlex ID: W4206756892 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023148
@@ Property / cites work: Q4023148 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of radicals in noncommutative rings
+Normal rank
@@ Property / cites work @@
+The complexity of module radicals
@@ Property / cites work: The complexity of module radicals / rank @@
+Normal rank
@@ Property / cites work @@
+Ideals in computable rings
@@ Property / cites work: Ideals in computable rings / rank @@
+Normal rank
@@ Property / cites work @@
+Effective procedures in field theory
@@ Property / cites work: Effective procedures in field theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q2734153
@@ Property / cites work: Q2734153 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of torsion-freeness of finitely presented groups
+Normal rank
@@ Property / cites work @@
+COMPUTABLE ABELIAN GROUPS
@@ Property / cites work: COMPUTABLE ABELIAN GROUPS / rank @@
+Normal rank
@@ Property / cites work @@
+Recursively enumerable vector spaces
@@ Property / cites work: Recursively enumerable vector spaces / rank @@
+Normal rank
@@ Property / cites work @@
+Effective content of field theory
@@ Property / cites work: Effective content of field theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3611832
@@ Property / cites work: Q3611832 / rank @@
+Normal rank
@@ Property / cites work @@
+Computable Algebra, General Theory and Theory of Computable Fields
+Normal rank
@@ Property / cites work @@
+The decomposability problem for torsion-free abelian groups is analytic-complete
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank
@@ Property / cites work @@
+Turing Computability
@@ Property / cites work: Turing Computability / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of radicals and socles of modules
@@ Property / cites work: The complexity of radicals and socles of modules / rank @@
+Normal rank