Polynomially computable structures with finitely many generators (Q2213937): Difference between revisions

@@ Property / DOI @@
-.1007/s10469-020-09598-5
@@ Property / DOI: 10.1007/s10469-020-09598-5 / rank @@
-Normal rank
@@ Property / cites work @@
+Polynomial-time versus recursive models
@@ Property / cites work: Polynomial-time versus recursive models / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249365
@@ Property / cites work: Q4249365 / rank @@
+Normal rank
@@ Property / cites work @@
+Structures computable in polynomial time. I
@@ Property / cites work: Structures computable in polynomial time. I / rank @@
+Normal rank
@@ Property / cites work @@
+Fields of algebraic numbers computable in polynomial time. I
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Some algorithmic problems for solvable groups
@@ Property / cites work: Some algorithmic problems for solvable groups / rank @@
+Normal rank
@@ Property / cites work @@
+Ideal membership in polynomial rings over the integers
+Normal rank
@@ Property / cites work @@
+Some complexity results for polynomial ideals
@@ Property / cites work: Some complexity results for polynomial ideals / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10469-020-09598-5
@@ Property / DOI: 10.1007/S10469-020-09598-5 / rank @@
+Normal rank