Skip to Main content Skip to Navigation


...
hal-00780388v2  Conference papers
Jean-Charles FaugèreMohab Safey El DinThibaut Verron. On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems
The 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, Maine, United States. pp.189-196, ⟨10.1145/2465506.2465943⟩
...
hal-00849523v2  Journal articles
Aurélien GreuetMohab Safey El Din. Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2014, 24 (3), pp.1313-1343. ⟨10.1137/130931308⟩
inria-00099273v1  Journal articles
Daniel Lazard. Calcul formel : tendances et progrès récents
Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 2000, 19 (1-2-3), pp.325-333
...
hal-03386106v1  Conference papers
Eleonora GuerriniRomain LebretonIlaria Zappatore. Polynomial Linear System Solving with Random Errors: New Bounds and Early Termination Technique
ISSAC 2021 - 46th International Symposium on Symbolic and Algebraic Computation, Jul 2021, Saint Petersburg, Russia. pp.171-178, ⟨10.1145/3452143.3465548⟩
...
hal-02002689v2  Conference papers
Matías R BenderJean-Charles FaugèreElias P. Tsigaridas. Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems
ISSAC 2019 - 44th International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China. pp.42-49, ⟨10.1145/3326229.3326248⟩
...
hal-01525560v1  Conference papers
Angelos MantzaflarisElias Tsigaridas. Resultants and Discriminants for Bivariate Tensor-product Polynomials
ISSAC 2017 - International Symposium on Symbolic and Algebraic Computation, Mohab Safey El Din, Jul 2017, Kaiserslautern, Germany. pp.8, ⟨10.1145/3087604.3087646⟩
...
inria-00107534v1  Conference papers
Daniel Lazard. On the specification for solvers of polynomial systems
5th Asian Symposium on Computer Mathematics - ASCM 2001, Sep 2001, Matsuyama, Japan. pp.66 - 75, ⟨10.1142/9789812799661_0007⟩
...
hal-01401134v1  Conference papers
Ioannis Z. EmirisAngelos MantzaflarisElias Tsigaridas. On the Bit Complexity of Solving Bilinear Polynomial Systems
ISSAC '16 - 41st International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.215-222, ⟨10.1145/2930889.2930919⟩
...
hal-01787549v1  Conference papers
Matías R BenderJean-Charles FaugèreAngelos MantzaflarisElias Tsigaridas. Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors
ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. ⟨10.1145/3208976.3209011⟩
...
hal-00849057v3  Journal articles
Mohab Safey El DinÉric Schost. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets
Journal of the ACM (JACM), Association for Computing Machinery, 2017, 63 (6), pp.48:1--48:37. ⟨10.1145/2996450⟩
...
hal-01787423v2  Conference papers
Matías R BenderJean-Charles FaugèreElias Tsigaridas. Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case
ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. ⟨10.1145/3208976.3209018⟩
...
hal-00922718v1  Conference papers
Mohab Safey El Din. Critical Point Methods and Effective Real Algebraic Geometry: New Results and Trends
ISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.5-6, ⟨10.1145/2465506.2465928⟩
...
inria-00107866v1  Conference papers
Daniel Lazard. Resolution of polynomial systems
4th Asian Symposium on Computer Mathematics - ASCM 2000, Dec 2000, Chiang Mai, Thailand. pp.1 - 8