| [1] |
I. Abdeljaouad-Tej, S. Orange, G. Renault, and A. Valibouze.
Computation of the decomposition group of a triangular ideal.
Appl. Algebra Engrg. Comm. Comput., 15(3-4):279–294, 2004. |
| [2] |
Fatima Abu Salem, Shuhong Gao, and Alan G. B. Lauder.
Factoring polynomials via polytopes.
In ISSAC 2004, pages 4–11. ACM, New York, 2004. |
| [3] |
Gwénolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe,
and Makoto Sugita.
Comparison between XL and Gröbner basis algorithms.
In Advances in Cryptology—Asiacrypt 2004, volume 3329 of
Lecture Notes in Comput. Sci., pages 338–353. Springer, Berlin, 2004. |
| [4] |
Thomas Beth, Jörn Müller-Quade, and Rainer Steinwandt.
Computing restrictions of ideals in finitely generated k-algebras
by means of Buchberger's algorithm.
J. Symbolic Comput., 41(3-4):372–380, 2006. |
| [5] |
Alin Bostan, Bruno Salvy, and Éric Schost.
Fast algorithms for zero-dimensional polynomial systems using
duality.
Appl. Algebra Engrg. Comm. Comput., 14(4):239–272, 2003. |
| [6] |
Wolfram Decker and Theo de Jong.
Gröbner bases and invariant theory.
In Gröbner bases and applications (Linz, 1998), volume 251
of London Math. Soc. Lecture Note Ser., pages 61–89. Cambridge Univ.
Press, Cambridge, 1998. |
| [7] |
Harm Derksen.
Computation of invariants for reductive groups.
Adv. Math., 141(2):366–384, 1999. |
| [8] |
Harm Derksen and Gregor Kemper.
Computational Invariant Theory.
Invariant Theory and Algebraic Transformation Groups, I.
Springer-Verlag, Berlin, 2002. |
| [9] |
C. Durvye and G. Lecerf.
A concise proof of the Kronecker polynomial system solver from
scratch.
Preprint, 33 pages, 2006. |
| [10] |
Nicholas Eriksson.
Toric ideals of homogeneous phylogenetic models.
In ISSAC 2004, pages 149–154. ACM, New York, 2004. |
| [11] |
Jeffrey B. Farr and Shuhong Gao.
Computing Gröbner bases for vanishing ideals of finite sets of
points.
In Applied Algebra, Algebraic Algorithms and
Error-correcting Codes, volume 3857 of Lecture Notes in Comput.
Sci., pages 118–127. Springer, Berlin, 2006. |
| [12] |
Jeffrey B. Farr and Shuhong Gao.
Gröbner bases and generalized Padé approximation.
Math. Comp., 75(253):461–473 (electronic), 2006. |
| [13] |
Shuhong Gao, Daqing Wan, and Mingsheng Wang.
Primary decomposition of zero-dimensional ideals over finite fields.
Preprint, 12 pages, 2006. |
| [14] |
Karin Gatermann and Frédéric Guyard.
Gröbner bases, invariant theory and equivariant dynamics.
J. Symbolic Comput., 28(1-2):275–302, 1999. |
| [15] |
Vladimir P. Gerdt.
Involutive algorithms for computing Gröbner bases.
In Computational Commutative and Non-commutative Algebraic
Geometry, volume 196 of NATO Sci. Ser. III Comput. Syst. Sci., pages
199–225. IOS, Amsterdam, 2005. |
| [16] |
Vladimir P. Gerdt and Yuri A. Blinkov.
On computing Janet bases for degree compatible orderings.
In Proceedings of the 10th Rhine Workshop on Computer Algebra
(Basel, 2006, pages 107–117. University of Basel, Basel, 2006. |
| [17] |
Marc Giusti, Grégoire Lecerf, and Bruno Salvy.
A Gröbner free alternative for polynomial system solving.
J. Complexity, 17(1):154–211, 2001. |
| [18] |
Marc Giusti and Éric Schost.
Solving some overdetermined polynomial systems.
In ISSAC '99: Proceedings of the 1999 International Symposium on
Symbolic and Algebraic Computation (Vancouver, BC), pages 1–8 (electronic),
New York, 1999. ACM. |
| [19] |
Mikael Johansson.
Computation of Poincaré-Betti series for monomial rings.
Rend. Istit. Mat. Univ. Trieste, 37(1-2):85–94 (2006), 2005. |
| [20] |
Gregor Kemper.
Computational invariant theory.
In The Curves Seminar at Queen's. Vol. XII (Kingston, ON,
1998), volume 114 of Queen's Papers in Pure and Appl. Math., pages
5–26. Queen's Univ., Kingston, ON, 1998. |
| [21] |
Gregor Kemper.
An algorithm to calculate optimal homogeneous systems of parameters.
J. Symbolic Comput., 27(2):171–184, 1999. |
| [22] |
Gregor Kemper.
The calculation of radical ideals in positive characteristic.
J. Symbolic Comput., 34(3):229–238, 2002. |
| [23] |
Gregor Kemper.
Computing invariants of reductive groups in positive characteristic.
Transform. Groups, 8(2):159–176, 2003. |
| [24] |
Simon King.
Fast computation of secondary invariants.
arXiv:math/0701270, 13 pages, 2007. |
| [25] |
Simon King.
Minimal generating sets of non-modular invariant rings of finite
groups.
arXiv:math/0703035, 14 pages, 2007. |
| [26] |
Alexey Koloydenko.
Symmetric measures via moments.
arXiv:math.PR/0406173, 50 pages, 2004. |
| [27] |
Teresa Krick.
Straight-line programs in polynomial equation solving.
In Foundations of Computational Mathematics: Minneapolis,
2002, volume 312 of London Math. Soc. Lecture Note Ser., pages
96–136. Cambridge Univ. Press, Cambridge, 2004. |
| [28] |
G. Lecerf.
Quadratic Newton iteration for systems with multiplicity.
Found. Comput. Math., 2(3):247–293, 2002. |
| [29] |
Grégoire Lecerf.
Computing the equidimensional decomposition of an algebraic closed
set by means of lifting fibers.
J. Complexity, 19(4):564–596, 2003. |
| [30] |
Mbakop Guy Merlin.
Eziente Losung reeller Polynomialer Gleichungssysteme.
PhD Thesis, Humboldt-Universität, Berlin, 1999. |
| [31] |
Bernard Mourrain.
Generalized normal forms and polynomial system solving.
In ISSAC'05: Proceedings of the 2005 International Symposium
on Symbolic and Algebraic Computation, pages 253–260 (electronic).
ACM, New York, 2005. |
| [32] |
Jörn Müller-Quade and Rainer Steinwandt.
Basic algorithms for rational function fields.
J. Symbolic Comput., 27(2):143–170, 1999. |
| [33] |
Jörn Müller-Quade and Rainer Steinwandt.
Gröbner bases applied to finitely generated field extensions.
J. Symbolic Comput., 30(4):469–490, 2000. |
| [34] |
G. H. Norton and A. Sălăgean.
Cyclic codes and minimal strong Gröbner bases over a principal
ideal ring.
Finite Fields Appl., 9(2):237–249, 2003. |
| [35] |
Fabrice Rouillier, Mohab Safey El Din, and Éric Schost.
Solving the birkhoff interpolation problem via the critical point
method: An experimental study.
In Jürgen Richter-Gebert and Dongming Wang, editors, ADG
'00: Revised Papers from the Third International Workshop on Automated
Deduction in Geometry (Zurich, 2000), volume 2061 of Lecture Notes in
Computer Science, pages viii+325. Springer-Verlag, Berlin, 2001. |
| [36] |
Éric Schost.
Degree bounds and lifting techniques for triangular sets.
In Proceedings of the 2002 International Symposium on Symbolic
and Algebraic Computation, pages 238–245 (electronic), New York, 2002. ACM. |
| [37] |
Éric Schost.
Complexity results for triangular sets.
J. Symbolic Comput., 36(3-4):555–594, 2003. |
| [38] |
Éric Schost.
Computing parametric geometric resolutions.
Appl. Algebra Engrg. Comm. Comput., 13(5):349–393, 2003. |
| [39] |
R. James Shank and David L. Wehlau.
Computing modular invariants of p-groups.
J. Symbolic Comput., 34(5):307–327, 2002. |
| [40] |
Jessica Sidman and Seth Sullivant.
Prolongations and computational algebra.
arXiv:math.AC/0611696, 17 pages, 2006. |
| [41] |
Allan Steel.
Conquering inseparability: Primary decomposition and multivariate
factorization over algebraic function fields of positive characteristic.
J. Symbolic Comput., 40(3):1053–1075, 2005. |
| [42] |
Till Stegers.
Faugère's F5 algorithm revisited.
Preprint, page 81, 2006. |
| [43] |
Rainer Steinwandt.
Decomposing systems of polynomial equations.
In Computer Algebra in Scientific Computing—CASC'99
(Munich), pages 387–407. Springer, Berlin, 1999. |
| [44] |
Rainer Steinwandt.
Implicitizing without tag variables.
In Proceedings of the 8th Rhine Workshop on Computer Algebra,
pages 217–224. 2002. |
| [45] |
Rainer Steinwandt and Jörn Müller-Quade.
Freeness, linear disjointness, and implicitization—a classical
approach.
Beiträge Algebra Geom., 41(1):57–66, 2000. |
| [46] |
Mark van Hoeij.
Factoring polynomials and the knapsack problem.
J. Number Theory, 95(2):167–189, 2002. |
