Guillermo Matera

According to our database1, Guillermo Matera authored at least 33 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the computation of rational solutions of underdetermined systems over a finite field.
J. Complex., April, 2023

2022
Shifted varieties and discrete neighborhoods around varieties.
J. Symb. Comput., 2022

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field.
Comb. Probab. Comput., 2022

2021
Interpolation by decomposable univariate polynomials.
CoRR, 2021

2019
On the bit complexity of polynomial system solving.
J. Complex., 2019

2017
On the computation of rational points of a hypersurface over a finite field.
J. Complex., 2017

The distribution of factorization patterns on linear families of polynomials over a finite field.
Comb., 2017

2016
Newton's method and a mesh-independence principle for certain semilinear boundary-value problems.
J. Comput. Appl. Math., 2016

Quiz games as a model for information hiding.
J. Complex., 2016

2015
Degeneracy Loci and Polynomial Equation Solving.
Found. Comput. Math., 2015

Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field.
Finite Fields Their Appl., 2015

2014
On the value set of small families of polynomials over a finite field, I.
J. Comb. Theory, Ser. A, 2014

2012
Singularities of symmetric hypersurfaces and Reed-Solomon codes.
Adv. Math. Commun., 2012

2011
Lower complexity bounds for interpolation algorithms.
J. Complex., 2011

2009
Deformation Techniques for Sparse Systems.
Found. Comput. Math., 2009

On the solution of the polynomial systems arising in the discretization of certain ODEs.
Computing, 2009

Robust Algorithms For Generalized Pham Systems.
Comput. Complex., 2009

2006
Fast computation of a rational point of a variety over a finite field.
Math. Comput., 2006

Improved explicit estimates on the number of solutions of equations over a finite field.
Finite Fields Their Appl., 2006

Inverting bijective polynomial maps over finite fields.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2005
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study.
J. Complex., 2005

2004
Polynomial equation solving by lifting procedures for ramified fibers.
Theor. Comput. Sci., 2004

2003
Fast computation of discrete invariants associated to a differential rational mapping.
J. Symb. Comput., 2003

The Hardness of Polynomial Equation Solving.
Found. Comput. Math., 2003

2002
Functional programming concepts and straight-line programs in computer algebra.
Math. Comput. Simul., 2002

The differential Hilbert function of a differential rational mapping can be computed in polynomial time.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
A new method to obtain lower bounds for polynomial evaluation.
Theor. Comput. Sci., 2001

On the Time-Space Complexity of Geometric Elimination Procedures.
Appl. Algebra Eng. Commun. Comput., 2001

2000
Time-Space Tradeoffs in Algebraic Complexity Theory.
J. Complex., 2000

1999
Probabilistic Algorithms for Geometric Elimination.
Appl. Algebra Eng. Commun. Comput., 1999

OpTERA - Optimization and Real Equation Solving.
Proceedings of the German-Argentinian Workshop on Information Technology, 1999

1998
Combinatorial Hardness Proofs for Polynomial Evaluation.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1995
Integration of Multivariate Rational Functions Given by Straight-Line Programs.
Proceedings of the Applied Algebra, 1995


  Loading...