parametric GCD

swMATH35034MaRDI QIDQ46743FDOQ46743

Author name not available (Why is that?)

Described by source

• An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD

Cited In (3)

• A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
• Testing zero-dimensionality of varieties at a point
• Algorithms for computing greatest common divisors of parametric multivariate polynomials

This page was built for software: parametric GCD