Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies
DSpace/Manakin Repository
JavaScript is disabled for your browser. Some features of this site may not work without it.
Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies