Luis Miguel Pardo

From MaRDI portal
Person:423885

Available identifiers

zbMath Open pardo.luis-miguelMaRDI QIDQ423885

List of research outcomes





PublicationDate of PublicationType
In memoriam. Succinct obituary in memoriam of Joos Heintz2025-01-17Paper
Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics2024-01-18Paper
An unfeasibility view of neural network learning2023-02-17Paper
Intrinsic complexity for constructing zero-dimensional Gröbner bases2022-12-21Paper
Empirical phi-divergence test statistics in the logistic regression model2021-12-02Paper
A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density2021-11-25Paper
On Bézout inequalities for non-homogeneous polynomial ideals2021-06-03Paper
https://portal.mardi4nfdi.de/entity/Q45943252017-11-23Paper
https://portal.mardi4nfdi.de/entity/Q45943322017-11-23Paper
On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant2016-09-23Paper
On Kolmogorov complexity in the real Turing machine setting2016-06-09Paper
Quiz games as a model for information hiding2016-04-20Paper
An arithmetic Poisson formula for the multi-variate resultant2014-03-25Paper
Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces2012-07-03Paper
Bipolar varieties and real solving of a singular polynomial equation2012-07-02Paper
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian2012-05-30Paper
Generalized polar varieties and an efficient real elimination.2012-04-23Paper
Efficient polynomial system solving by numerical methods2012-01-05Paper
Rabin's width of a complete proof and the width of a semialgebraic set2011-04-16Paper
Efficient polynomial system-solving by numerical methods2011-04-13Paper
Smale's 17th problem: average polynomial time to compute affine and projective solutions2011-03-02Paper
Fast linear homotopy to find approximate zeros of polynomial systems2011-02-18Paper
On the intrinsic complexity of point finding in real singular hypersurfaces2010-09-01Paper
On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations2010-03-19Paper
On the probability distribution of data at points in real complete intersection varieties2008-09-19Paper
On Smale's 17th problem: a probabilistic positive solution2008-08-20Paper
VC Dimension Bounds for Analytic Algebraic Computations2008-07-10Paper
On the probability distribution of singular varieties of given corank2007-10-23Paper
On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case2007-05-02Paper
Estimates on the distribution of the condition number of singular matrices2007-03-12Paper
https://portal.mardi4nfdi.de/entity/Q34212752007-02-12Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Generalized polar varieties: geometry and algorithms2005-09-02Paper
Upper bounds on the distribution of the condition number of singular matrices2005-08-01Paper
Deformation techniques to solve generalised Pham systems2004-08-06Paper
Sharp estimates for the arithmetic Nullstellensatz2002-10-27Paper
Kronecker's and Newton's approaches to solving: a first comparison2002-08-11Paper
On the intrinsic complexity of the arithmetic Nullstellensatz2001-10-19Paper
A new method to obtain lower bounds for polynomial evaluation2001-08-20Paper
On the uniform distribution of rational inputs with respect to condition numbers of Numerical Analysis2001-03-15Paper
Straight-line programs in geometric elimination theory2000-05-29Paper
Time-space tradeoffs in algebraic complexity theory2000-01-01Paper
Le rapport entre le temps et l'espace pour l'évaluation des polynômes1999-06-20Paper
The intrinsic complexity of parametric elimination methods1999-03-18Paper
https://portal.mardi4nfdi.de/entity/Q42180971999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q42287291999-03-01Paper
https://portal.mardi4nfdi.de/entity/Q43527971998-12-07Paper
https://portal.mardi4nfdi.de/entity/Q43527831998-11-01Paper
Le rôle des structures de données dans les problèmes d'élimination1998-04-20Paper
https://portal.mardi4nfdi.de/entity/Q47140221998-01-05Paper
Lower bounds for diophantine approximations1997-06-23Paper
Lower bounds for arithmetic networks. II: Sum of Betti numbers1996-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42973801994-08-22Paper
A note on Rabin's width of a complete proof1994-06-19Paper
An extension of Warren's lower bounds for approximations1993-11-01Paper
Lower bounds for arithmetic networks1993-06-29Paper
TIME BOUNDED COMPUTATIONS OVER THE REALS1993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q44246191993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39733441992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q37756541987-01-01Paper

Research outcomes over time

This page was built for person: Luis Miguel Pardo