An algorithm for decomposing a polynomial system into normal ascending sets (Q2464308): Difference between revisions

@@ Property / cites work @@
+Q3994509
@@ Property / cites work: Q3994509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3490991
@@ Property / cites work: Q3490991 / rank @@
+Normal rank
@@ Property / cites work @@
+Elimination methods
@@ Property / cites work: Elimination methods / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234261
@@ Property / cites work: Q4234261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3963106
@@ Property / cites work: Q3963106 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5427316
@@ Property / cites work: Q5427316 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4303118
@@ Property / cites work: Q4303118 / rank @@
+Normal rank
@@ Property / cites work @@
+A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
+Normal rank
@@ Property / cites work @@
+A new method for solving algebraic systems of positive dimension
+Normal rank
@@ Property / cites work @@
+On the theories of triangular sets
@@ Property / cites work: On the theories of triangular sets / rank @@
+Normal rank
@@ Property / cites work @@
+Triviality and dimension of a system of algebraic differential equations
+Normal rank
@@ Property / cites work @@
+Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
+Normal rank