The following pages link to Guillermo Matera (Q191904):
Displayed 50 items.
- Quiz games as a model for information hiding (Q272185) (← links)
- Random hypersurfaces and embedding curves in surfaces over finite fields (Q308143) (← links)
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials (Q312198) (← links)
- Increasing the order of convergence for iterative methods to solve nonlinear systems (Q331791) (← links)
- E-characteristic polynomials of tensors (Q359704) (← links)
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
- Singularities of symmetric hypersurfaces and Reed-Solomon codes (Q414952) (← links)
- Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field (Q473082) (← links)
- A baby step-giant step roadmap algorithm for general algebraic sets (Q486687) (← links)
- Efficient computation of pairings on Jacobi quartic elliptic curves (Q490338) (← links)
- Interpolation in affine and projective space over a finite field (Q491432) (← links)
- Numbers of points of surfaces in the projective 3-space over finite fields (Q491991) (← links)
- On primitive elements in finite fields of low characteristic (Q491996) (← links)
- Newton's method and a mesh-independence principle for certain semilinear boundary-value problems (Q495063) (← links)
- Explicit estimates for the number of rational points of singular complete intersections over a finite field (Q495273) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Robust algorithms for generalized Pham systems (Q626616) (← links)
- Shifted varieties and discrete neighborhoods around varieties (Q820939) (← links)
- On the solution of the polynomial systems arising in the discretization of certain ODEs (Q836949) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Probabilistic algorithms for geometric elimination (Q1304992) (← links)
- The distribution of factorization patterns on linear families of polynomials over a finite field (Q1714947) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Uniform bounds on the number of rational points of a family of curves of genus 2 (Q1773332) (← links)
- (Q1878483) (redirect page) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- The number of reducible space curves over a finite field (Q1938580) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Improved bounds for the inverses of diagonally dominant tridiagonal matrices (Q2002808) (← links)
- Factorization patterns on nonlinear families of univariate polynomials over a finite field (Q2304196) (← links)
- Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- On the computation of rational points of a hypersurface over a finite field (Q2360665) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- Numerically intersecting algebraic varieties via witness sets (Q2434875) (← links)
- On the Geil-Matsumoto bound and the length of AG codes (Q2436571) (← links)
- On the value set of small families of polynomials over a finite field. I (Q2439575) (← links)
- Improved explicit estimates on the number of solutions of equations over a finite field (Q2490135) (← links)
- On the computation of rational solutions of underdetermined systems over a finite field (Q2685068) (← links)
- On the value set of small families of polynomials over a finite field, III (Q2829807) (← links)
- On the value set of small families of polynomials over a finite field, II (Q3190351) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- (Q4218097) (← links)
- The intrinsic complexity of parametric elimination methods (Q4233451) (← links)
- Le rapport entre le temps et l'espace pour l'évaluation des polynômes (Q4235421) (← links)
- The Space Complexity of Elimination Theory: Upper Bounds (Q4336106) (← links)
- (Q4352809) (← links)
- Density of real and complex decomposable univariate polynomials (Q4555471) (← links)
- (Q4660702) (← links)