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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2011.08.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992550888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics on lattice basis reduction in practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorization of multivariate polynomials via differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rank-Revealing Method with Updating, Downdating, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inequality About Factors of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the GCD of polynomials using gaussian transformations and shifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of approximate polynomial GCDs and an extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing certified approximate GCD of \(n\) univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4008406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-gcd computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate polynomial GCD: small degree and small height perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Polynomial gcd: Small Degree and Small Height Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate GCD of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2740672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2725944 / rank
 
Normal rank

Latest revision as of 18:56, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximate polynomial GCD over integers
scientific article

    Statements

    Approximate polynomial GCD over integers (English)
    0 references
    0 references
    19 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate polynomial GCD
    0 references
    numerical polynomial GCD
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references