Luis Miguel Pardo

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 3

Top Topics

Valid Inequalities

Partially Ordered

Training Process

Subtour Elimination

Top Venues

Publications

Joos Heintz, Luis Miguel Pardo, Enrique Carlos Segura, Hvara Ocar, Andres Rojas Paredes
An unfeasibility view of neural network learning. J. Complex. 75 (2023)
Joos Heintz, Hvara Ocar, Luis Miguel Pardo, Andres Rojas Paredes, Enrique Carlos Segura
An unfeasability view of neural network learning. CoRR (2022)
Amir Hashemi, Joos Heintz, Luis Miguel Pardo, Pablo Solernó
On Bezout Inequalities for non-homogeneous Polynomial Ideals. CoRR (2017)
Jérémy Berthomieu, Luis Miguel Pardo
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian. J. Complex. 28 (3) (2012)
Bernd Bank, Marc Giusti, Joos Heintz, Lutz Lehmann, Luis Miguel Pardo
Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces. Found. Comput. Math. 12 (1) (2012)
Carlos Beltrán, Luis Miguel Pardo
Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems. Found. Comput. Math. 11 (1) (2011)
Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo
On the intrinsic complexity of point finding in real singular hypersurfaces. Inf. Process. Lett. 109 (19) (2009)
André Galligo, Luis Miguel Pardo, Josef Schicho
Effective methods in algebraic geometry. J. Symb. Comput. 44 (9) (2009)
José Luis Montaña, Luis Miguel Pardo, Mar Callau
VC Dimension Bounds for Analytic Algebraic Computations. COCOON (2008)
Carlos Beltrán, Luis Miguel Pardo
On Smale's 17th Problem: A Probabilistic Positive Solution. Found. Comput. Math. 8 (1) (2008)
Carlos Beltrán, Luis Miguel Pardo
On the probability distribution of singular varieties of given corank. J. Symb. Comput. 42 (1-2) (2007)
Carlos Beltrán, Luis Miguel Pardo
Estimates on the Distribution of the Condition Number of Singular Matrices. Found. Comput. Math. 7 (1) (2007)
Carlos Beltrán, Luis Miguel Pardo
On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case. Math. Comput. 76 (259) (2007)
Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo
Generalized polar varieties: geometry and algorithms. J. Complex. 21 (4) (2005)
César Luis Alonso, José Luis Montaña, Luis Miguel Pardo
On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions. MFCS (2005)
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
04061 Summary - Real Computation and Complexity. Real Computation and Complexity (2004)
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity (2004)
Luis Miguel Pardo, Jorge San Martín
Deformation techniques to solve generalised Pham systems. Theor. Comput. Sci. 315 (2-3) (2004)
Marc Giusti, Luis Miguel Pardo
Preface. J. Symb. Comput. 36 (3-4) (2003)
D. Castro, Luis Miguel Pardo, Jorge San Martín
Systems of rational polynomial equations have polynomial size approximate zeros on the average. J. Complex. 19 (2) (2003)
David Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo
The Hardness of Polynomial Equation Solving. Found. Comput. Math. 3 (4) (2003)
D. Castro, José Luis Montaña, Luis Miguel Pardo, Jorge San Martín
The Distribution of Condition Numbers of Rational Data of Bounded Bit Length. Found. Comput. Math. 2 (1) (2002)
Mikel Aldaz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
A new method to obtain lower bounds for polynomial evaluation. Theor. Comput. Sci. 259 (1-2) (2001)
D. Castro, Luis Miguel Pardo, Klemens Hägele, Jose Enrique Morais
Kronecker's and Newton's Approaches to Solving: A First Comparison. J. Complex. 17 (1) (2001)
Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
Time-Space Tradeoffs in Algebraic Complexity Theory. J. Complex. 16 (1) (2000)
Teresa Krick, Luis Miguel Pardo, Martín Sombra
Arithmetic Nullstellensätze. SIGSAM Bull. 33 (3) (1999)
José Luis Montaña, Luis Miguel Pardo
On Kolmogorov Complexity in the Real Turing Machine Setting. Inf. Process. Lett. 67 (2) (1998)
Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS (1998)
Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo
When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC (1995)
José Luis Montaña, Jose Enrique Morais, Luis Miguel Pardo
Lower bounds for arithmetic networks II: Sum of Betti numbers. Appl. Algebra Eng. Commun. Comput. 7 (1) (1995)
Luis Miguel Pardo
How Lower and Upper Complexity Bounds Meet in Elimination Theory. AAECC (1995)
José Luis Montaña, Luis Miguel Pardo, Tomás Recio
A Note on Rabin's Width of a Complete Proof. Comput. Complex. 4 (1994)
José Luis Montaña, Luis Miguel Pardo
Lower Bounds for Arithmetic Networks. Appl. Algebra Eng. Commun. Comput. 4 (1993)
Felipe Cucker, Luis Miguel Pardo, Mario Raimondo, Tomás Recio, Marie-Françoise Roy
On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve. AAECC (1987)
Tomás Recio, Luis Miguel Pardo
Rabin's width of a complete proof and the width of a semialgebraic set. EUROCAL (1987)