Computable fields and the bounded Turing reduction (Q408170): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.apal.2011.11.007
+Normal rank
@@ Property / OpenAlex ID @@
+W1978583361
@@ Property / OpenAlex ID: W1978583361 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4423053
@@ Property / cites work: Q4423053 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3027108
@@ Property / cites work: Q3027108 / 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 @@
+Is it harder to factor a polynomial or to find a root?
+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 @@
+Computable Fields and Weak Truth-Table Reducibility
+Normal rank
@@ Property / cites work @@
+Q5798024
@@ Property / cites work: Q5798024 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3943047
@@ Property / cites work: Q3943047 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:408170