Towards Mixed Gröbner Basis Algorithms-Reference-Cited by-同舟云学术

Towards Mixed Gröbner Basis Algorithms

Published:2018-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Bender Matías R.¹,Faugère Jean-Charles¹,Tsigaridas Elias¹

Affiliation:

1. Sorbonne Université, CNRS, INRIA, Paris, France

Funder

Agence Nationale de la Recherche

Fondation Mathématique Jacques Hadamard

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3208976.3209018

Reference38 articles.

1. Formes d'inertie et complexe de Koszul associés à des polynômes plurihomogenes;Awane A.;Revista Matematica Complutense,2005

2. Bilinear Systems with Two Supports

3. Fewnomial bounds for completely mixed polynomial systems

4. N. Botbol. 2011. Implicitization of rational maps. Ph.D. Dissertation. bibinfoschoolUPMC. N. Botbol. 2011. Implicitization of rational maps. Ph.D. Dissertation. bibinfoschoolUPMC.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Greedy Approach to the Canny-Emiris Formula;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04

2. Solving Sparse Polynomial Systems using Gröbner Bases and Resultants;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04

3. Guessing Gröbner bases of structured ideals of relations of sequences;Journal of Symbolic Computation;2022-07

4. Toric eigenvalue methods for solving sparse polynomial systems;Mathematics of Computation;2022-06-30

5. Chordal graphs in triangular decomposition in top-down style;Journal of Symbolic Computation;2021-01