Matías R. Bender

According to our database, Matías R. Bender authored at least 15 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Dimension results for extremal-generic polynomial systems over complete toric varieties.

Matías R. Bender, Pierre-Jean Spaenlehauer

CoRR, 2023

2022

Toric eigenvalue methods for solving sparse polynomial systems.

Matías R. Bender, Simon Telen

Math. Comput., 2022

Solving sparse polynomial systems using Groebner bases and resultants.

Matías R. Bender

CoRR, 2022

Solving Sparse Polynomial Systems using Gröbner Bases and Resultants.

Matías R. Bender

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems.

Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas

SIAM J. Appl. Algebra Geom., 2021

A nearly optimal algorithm to decompose binary forms.

Matías R. Bender, Jean-Charles Faugère, Ludovic Perret, Elias P. Tsigaridas

J. Symb. Comput., 2021

Yet another eigenvalue algorithm for solving polynomial systems.

Matías R. Bender, Simon Telen

CoRR, 2021

2020

Classifier Construction in Boolean Networks Using Algebraic Methods.

Robert Schwieger, Matías R. Bender, Heike Siebert, Christian Haase

Proceedings of the Computational Methods in Systems Biology, 2020

2019

Algorithms for sparse polynomial systems : Gröbner bases and resultants. (Algorithmes pour les systèmes polynomiaux creux : bases de Gröbner et résultants).

Matías R. Bender

PhD thesis, 2019

Gr{ö}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems.

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

CoRR, 2019

Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems.

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

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

Towards Mixed Gr{ö}bner Basis Algorithms: the Multihomogeneous and Sparse Case.

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

CoRR, 2018

Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case.

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

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and Eigenvectors.

Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2016

A Superfast Randomized Algorithm to Decompose Binary Forms.

Matías R. Bender, Jean-Charles Faugère, Ludovic Perret, Elias P. Tsigaridas

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016