A subdivision method for computing nearest gcd with certification (Q638509): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.04.018
@@ Property / DOI: 10.1016/j.tcs.2011.04.018 / rank @@
-Normal rank
@@ Property / author @@
+Andre Galligo
@@ Property / author: Andre Galligo / rank @@
+Normal rank
@@ Property / author @@
+Mourrain, Bernard
@@ Property / author: Mourrain, Bernard / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MultRoot
@@ Property / describes a project that uses: MultRoot / rank @@
+Normal rank
@@ 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.tcs.2011.04.018
+Normal rank
@@ Property / OpenAlex ID @@
+W1987546967
@@ Property / OpenAlex ID: W1987546967 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for the topological type of real algebraic curve
+Normal rank
@@ Property / cites work @@
+When are two numerical polynomials relatively prime?
+Normal rank
@@ Property / cites work @@
+Q4314299
@@ Property / cites work: Q4314299 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5301644
@@ Property / cites work: Q5301644 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
@@ Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank @@
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
+Normal rank
@@ Property / cites work @@
+Computing nearest Gcd with certification
@@ Property / cites work: Computing nearest Gcd with certification / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227296
@@ Property / cites work: Q4227296 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4717939
@@ Property / cites work: Q4717939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4717942
@@ Property / cites work: Q4717942 / rank @@
+Normal rank
@@ Property / cites work @@
+Certified approximate univariate GCDs
@@ Property / cites work: Certified approximate univariate GCDs / rank @@
+Normal rank
@@ Property / cites work @@
+On location and approximation of clusters of zeros of analytic functions
+Normal rank
@@ Property / cites work @@
+Detection and validation of clusters of polynomial zeros
+Normal rank
@@ Property / cites work @@
+Q3447170
@@ Property / cites work: Q3447170 / rank @@
+Normal rank
@@ Property / cites work @@
+On approximate GCDs of univariate polynomials
@@ Property / cites work: On approximate GCDs of univariate polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for intersecting parametric and algebraic curves I
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+Global minimization of rational functions and the nearest GCDs
+Normal rank
@@ Property / cites work @@
+Approximate GCD and its application to ill-conditioned algebraic equations
+Normal rank
@@ Property / cites work @@
+Computation of approximate polynomial GCDs and an extension
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's Theorem I: Geometric Aspects
+Normal rank
@@ Property / cites work @@
+An iterative method for calculating approximate GCD of univariate polynomials
+Normal rank
@@ Property / cites work @@
+A geometric method in nonlinear programming
@@ Property / cites work: A geometric method in nonlinear programming / rank @@
+Normal rank
@@ Property / cites work @@
+The approximate GCD of inexact polynomials
@@ Property / cites work: The approximate GCD of inexact polynomials / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.04.018
@@ Property / DOI: 10.1016/J.TCS.2011.04.018 / rank @@
+Normal rank