Algorithms for computing greatest common divisors of parametric multivariate polynomials
暂无分享,去创建一个
Michael Monagan | Yao Sun | Deepak Kapur | Dong Lu | Dingkang Wang | D. Kapur | M. Monagan | Dingkang Wang | Yao Sun | Dong Lu
[1] 佐藤 洋祐,et al. 特集 Comprehensive Grobner Bases , 2007 .
[2] Tateaki Sasaki,et al. Computation of GCD of Sparse Multivariate Polynomials by Extended Hensel Construction , 2015, 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).
[3] Katsusuke Nabeshima,et al. On the computation of parametric Gröbner bases for modules and syzygies , 2010 .
[4] Kosaku Nagasaka,et al. Parametric Greatest Common Divisors using Comprehensive Gröbner Systems , 2017, ISSAC.
[5] Antonio Montes,et al. A New Algorithm for Discussing Gröbner Bases with Parameters , 2002, J. Symb. Comput..
[6] Yao Sun,et al. A new algorithm for computing comprehensive Gröbner systems , 2010, ISSAC.
[7] Masayuki Suzuki,et al. Three New Algorithms for Multivariate Polynomial GCD , 1992, J. Symb. Comput..
[8] Patrizia M. Gianni,et al. GCD's and Factoring Multivariate Polynominals Using Gröbner Bases , 1985, European Conference on Computer Algebra.
[9] A. Meyer,et al. The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .
[10] Deepak Kapur,et al. An Approach for Solving Systems of Parametric Polynomial Equations , 1993 .
[11] David A. Cox,et al. Ideals, Varieties, and Algorithms , 1997 .
[12] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[13] Yao Sun,et al. An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system , 2013, J. Symb. Comput..
[14] Sergei A. Abramov,et al. On the greatest common divisor of polynomials which depend on a parameter , 1993, ISSAC '93.
[15] Katsusuke Nabeshima. Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems , 2012, CASC.
[16] Volker Weispfenning,et al. Comprehensive Gröbner Bases , 1992, J. Symb. Comput..
[17] Ali Ayad,et al. Complexity of Algorithms for Computing Greatest Common Divisors of Parametric Univariate Polynomials , 2010 .
[18] Akira Suzuki,et al. A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases , 2006, ISSAC '06.
[19] Thomas Dubé,et al. The Structure of Polynomial Ideals and Gröbner Bases , 2013, SIAM J. Comput..
[20] Yiming Yan,et al. An Algorithm for Computing a Minimal Comprehensive Gröbner\, Basis of a Parametric Polynomial System , 2020, ArXiv.
[21] Joseph Lipman,et al. Algebraic Geometry and Commutative Algebra , 1987 .
[22] David Y. Y. Yun,et al. The EZ GCD algorithm , 1973, ACM Annual Conference.
[23] Christoph Lossen,et al. Computing in Algebraic Geometry: A Quick Start using SINGULAR , 2006 .
[24] Yao Sun,et al. An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD , 2018, ISSAC.
[25] Marina Weber,et al. Using Algebraic Geometry , 2016 .
[26] David Mumford,et al. What Can Be Computed in Algebraic Geometry , 1993, alg-geom/9304003.