Is it harder to factor a polynomial or to find a root? (Q3053472): Difference between revisions

@@ Property / cites work @@
+Q3313943
@@ Property / cites work: Q3313943 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3027108
@@ Property / cites work: Q3027108 / rank @@
+Normal rank
@@ Property / cites work @@
+TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
+Normal rank
@@ Property / cites work @@
+Reducibility and Completeness for Sets of Integers
+Normal rank
@@ Property / cites work @@
+Effective procedures in field theory
@@ Property / cites work: Effective procedures in field theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3222326
@@ Property / cites work: Q3222326 / 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 @@
+Q3588177
@@ Property / cites work: Q3588177 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>d</i>-computable categoricity for algebraic fields
+Normal rank
@@ Property / cites work @@
+Computable Algebra, General Theory and Theory of Computable Fields
+Normal rank
@@ Property / cites work @@
+Q3819052
@@ Property / cites work: Q3819052 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4934287
@@ Property / cites work: Q4934287 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5691146
@@ Property / cites work: Q5691146 / rank @@
+Normal rank