Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jsc.2019.10.006 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2019.10.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2980922731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3590274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What can be computed in algebraic geometry? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in algebraic geometry. A quick start using SINGULAR / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of Polynomial Ideals and Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for computing comprehensive Gröbner systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for discussing Gröbner bases with parameters. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of parametric Gröbner bases for modules and syzygies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Greatest Common Divisors using Comprehensive Gröbner Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three new algorithms for multivariate polynomial GCD / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical comprehensive Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JSC.2019.10.006 / rank
 
Normal rank

Latest revision as of 11:10, 17 December 2024

scientific article
Language Label Description Also known as
English
Algorithms for computing greatest common divisors of parametric multivariate polynomials
scientific article

    Statements

    Algorithms for computing greatest common divisors of parametric multivariate polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 September 2020
    0 references
    parametric multivariate polynomials
    0 references
    gcd system
    0 references
    minimal comprehensive Gröbner system
    0 references
    ideal intersection
    0 references
    ideal quotient
    0 references

    Identifiers