On the complexity of the F5 GrÃ?b-ner basis algorithm, J. Symbolic Comput, vol.70, pp.49-70, 2015. ,
Towards Mixed Gröbner Basis Algorithms: The Multihomogeneous and Sparse Case, Proc. ACM ISSAC, pp.71-78, 2018. ,
Castelnuovo Mumford regularity with respect to multigraded ideals, Journal of Algebra, vol.474, pp.361-392, 2017. ,
An e cient algorithm for the sparse mixed resultant, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp.89-104, 1993. ,
Bounds for Castelnuovo-Mumford Regularity in Terms of Degrees of De ning Equations, Commutative Algebra, pp.67-73, 2003. ,
Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach, SIAM J. Discr. Math, vol.30, pp.1534-1570, 2016. ,
, Using Algebraic Geometry, 2005.
, , 2011.
A survey on signature-based algorithms for computing Gröbner bases, J. Symbolic Comput, vol.80, pp.719-784, 2017. ,
Commutative Algebra: with a View Toward Algebraic Geometry, 2004. ,
On the Complexity of Sparse Elimination, Journal of Complexity, vol.12, pp.134-166, 1996. ,
Computer Algebra Methods for Studying and Computing Molecular Conformations, Algorithmica, vol.25, issue.2, pp.372-402, 1999. ,
A New E cient Algorithm for Computing Gröbner Bases Without Reduction to Zero (F5), Proc. ACM ISSAC (ISSAC '02), pp.75-83, 2002. ,
E cient Computation of Zero-dimensional GrÃ?bner Bases by Change of Ordering, J. Symbolic Comput, vol.16, issue.4, pp.329-344, 1993. ,
Sparse Gröbner bases: the unmixed case, Proc. ACM ISSAC, pp.178-185, 2014. ,
Polynomial Systems Solving by Fast Linear Algebra, 2013. ,
, Discriminants, Resultants, and Multidimensional Determinants, 1994.
Commutative Semigroup Rings, 1984. ,
On the Intrinsic Complexity of Elimination Theory, Journal of Complexity, vol.9, pp.471-498, 1993. ,
URL : https://hal.archives-ouvertes.fr/inria-00074751
A ne solution sets of sparse polynomial systems, J. Symbolic Comput, vol.51, pp.34-54, 2013. ,
A polyhedral method for solving sparse polynomial systems, Math. Comp, vol.64, pp.1541-1555, 1995. ,
GrÃ?bner-Bases, Gaussian Elimination and Resolution of Systems of Algebraic Equations, Proc. of the European Computer Algebra Conference (EUROCAL '83), pp.146-156, 1983. ,
Multigraded Castelnuovo-Mumford Regularity, J. Reine Angew. Math. (Crelles Journal, p.571, 2004. ,
Solving a sparse system using linear algebra, J. Symbolic Comput, vol.73, pp.157-174, 2016. ,
Some Complexity Results for Polynomial Ideals, Journal of Complexity, vol.13, pp.303-325, 1997. ,
Combinatorial Commutative Algebra, 2005. ,
On the Chordality of Polynomial Sets in Triangular Decomposition in Top-Down Style, Proc. ACM ISSAC, pp.287-294, 2018. ,
Solving degenerate sparse polynomial systems faster, J. Symbolic Comput, vol.28, pp.155-186, 1999. ,
A Sparse E ective Nullstellensatz, Advances in Applied Mathematics, vol.22, pp.271-295, 1999. ,
Sparse elimination theory, Proc. Comp. Algebraic Geom. and Commut. Algebra. CUP, pp.264-298, 1993. ,
On the Newton polytope of the resultant, Journal of Algebraic Combinatorics, vol.3, pp.207-236, 1994. ,
GrÃ?bner Bases and Convex Polytopes, 1996. ,
Solving systems of polynomial equations. Number 97, 2002. ,
Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin), J. Symbolic Comput, vol.43, pp.46-74, 2008. ,
Solving Polynomial Systems via a Stabilized Representation of Quotient Algebras, SIAM J. Matrix Anal. Appl, vol.39, issue.3, pp.1421-1447, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01630425
Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems, SIAM J. Numer. Anal, vol.31, issue.3, pp.915-930, 1994. ,
Multigraded formulae for multigraded resultants, J. Algebr. Geom, vol.3, pp.569-597, 1994. ,