暂无分享,去创建一个
[1] Marc Moreno Maza,et al. On the Theories of Triangular Sets , 1999, J. Symb. Comput..
[2] Changbo Chen,et al. Algorithms for computing triangular decomposition of polynomial systems , 2012, J. Symb. Comput..
[3] Martin Kreuzer,et al. Computational Commutative Algebra 1 , 2000 .
[4] Michael Kalkbrener,et al. A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties , 1993, J. Symb. Comput..
[5] N. Bose. Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory , 1995 .
[6] W. Wu. ON THE DECISION PROBLEM AND THE MECHANIZATION OF THEOREM-PROVING IN ELEMENTARY GEOMETRY , 2008 .
[7] Dongming Wang,et al. Computing Triangular Systems and Regular Systems , 2000, J. Symb. Comput..
[8] Yang Lu. Searching dependency between algebraic equations: an algorithm applied to automated reasoning , 1994 .
[9] Dongming Wang,et al. Elimination Methods , 2001, Texts and Monographs in Symbolic Computation.
[10] Xiao-Shan Gao,et al. Solving parametric algebraic systems , 1992, ISSAC '92.
[11] Daniel Lazard,et al. A new method for solving algebraic systems of positive dimension , 1991, Discret. Appl. Math..
[12] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[13] Masayuki Noro,et al. Computation of the splitting fields and the Galois groups of polynomials , 1996 .
[14] Donal O'Shea,et al. Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.
[15] Xiao-Shan Gao,et al. Ritt-Wu's Decomposition Algorithm and Geometry Theorem Proving , 1990, CADE.