Approximate polynomial GCD over integers (Q651873): Difference between revisions

@@ Property / DOI @@
-.1016/j.jsc.2011.08.011
@@ Property / DOI: 10.1016/j.jsc.2011.08.011 / 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.jsc.2011.08.011
+Normal rank
@@ Property / OpenAlex ID @@
+W1992550888
@@ Property / OpenAlex ID: W1992550888 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics on lattice basis reduction in practice
@@ Property / cites work: Heuristics on lattice basis reduction in practice / rank @@
+Normal rank
@@ Property / cites work @@
+Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
+Normal rank
@@ Property / cites work @@
+&amp;lt;tex&amp;gt;$QR$&amp;lt;/tex&amp;gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
+Normal rank
@@ Property / cites work @@
+Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
+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 @@
+Approximate factorization of multivariate polynomials via differential equations
+Normal rank
@@ Property / cites work @@
+Q3939874
@@ Property / cites work: Q3939874 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4787198
@@ Property / cites work: Q4787198 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
+Normal rank
@@ Property / cites work @@
+Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
+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 @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+A Rank-Revealing Method with Updating, Downdating, and Applications
+Normal rank
@@ Property / cites work @@
+An Inequality About Factors of Polynomials
@@ Property / cites work: An Inequality About Factors of Polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Computation of the GCD of polynomials using gaussian transformations and shifting
+Normal rank
@@ Property / cites work @@
+Q3994198
@@ Property / cites work: Q3994198 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250166
@@ Property / cites work: Q4250166 / rank @@
+Normal rank
@@ Property / cites work @@
+Computation of approximate polynomial GCDs and an extension
+Normal rank
@@ Property / cites work @@
+Q4375622
@@ Property / cites work: Q4375622 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
+Normal rank
@@ Property / cites work @@
+Q4008406
@@ Property / cites work: Q4008406 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4266548
@@ Property / cites work: Q4266548 / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice basis reduction: Improved practical algorithms and solving subset sum problems
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate polynomial GCD: small degree and small height perturbations
+Normal rank
@@ Property / cites work @@
+Approximate Polynomial gcd: Small Degree and Small Height Perturbations
+Normal rank
@@ Property / cites work @@
+QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
+Normal rank
@@ Property / cites work @@
+The approximate GCD of inexact polynomials
@@ Property / cites work: The approximate GCD of inexact polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
+Normal rank
@@ Property / cites work @@
+Q2740672
@@ Property / cites work: Q2740672 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2725944
@@ Property / cites work: Q2725944 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JSC.2011.08.011
@@ Property / DOI: 10.1016/J.JSC.2011.08.011 / rank @@
+Normal rank