Luis Miguel Pardo - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2023

An unfeasibility view of neural network learningJoos Heintz, Luis Miguel Pardo, Enrique Carlos Segura, Hvara Ocar, Andres Rojas Paredes. jc, 75:101710, April 2023. [doi]

2012

Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular HypersurfacesBernd Bank, Marc Giusti, Joos Heintz, Lutz Lehmann, Luis Miguel Pardo. focm, 12(1):75-122, 2012. [doi]

Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a GrassmannianJérémy Berthomieu, Luis Miguel Pardo. jc, 28(3):388-421, 2012. [doi]

2011

Fast Linear Homotopy to Find Approximate Zeros of Polynomial SystemsCarlos Beltrán, Luis Miguel Pardo. focm, 11(1):95-129, 2011. [doi]

2009

On the intrinsic complexity of point finding in real singular hypersurfacesBernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo. ipl, 109(19):1141-1144, 2009. [doi]

Effective methods in algebraic geometryAndré Galligo, Luis Miguel Pardo, Josef Schicho. JSC, 44(9):1087-1088, 2009. [doi]

2008

On Smale s 17th Problem: A Probabilistic Positive SolutionCarlos Beltrán, Luis Miguel Pardo. focm, 8(1):1-43, 2008. [doi]

VC Dimension Bounds for Analytic Algebraic ComputationsJosé Luis Montaña, Luis Miguel Pardo, Mar Callau. cocoon 2008: 62-71 [doi]

2007

On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton s method in the underdetermined caseCarlos Beltrán, Luis Miguel Pardo. moc, 76(259):1393-1424, 2007. [doi]

Estimates on the Distribution of the Condition Number of Singular MatricesCarlos Beltrán, Luis Miguel Pardo. focm, 7(1):87-134, 2007. [doi]

On the probability distribution of singular varieties of given corankCarlos Beltrán, Luis Miguel Pardo. JSC, 42(1-2):4-29, 2007. [doi]

2005

On the Number of Random Digits Required in MonteCarlo Integration of Definable FunctionsCésar Luis Alonso, José Luis Montaña, Luis Miguel Pardo. mfcs 2005: 83-94 [doi]

Generalized polar varieties: geometry and algorithmsBernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo. jc, 21(4):377-412, 2005. [doi]

2004

04061 Summary - Real Computation and ComplexityThomas Lickteig, Klaus Meer, Luis Miguel Pardo. Dagstuhl 2006: [doi]

04061 Abstracts Collection - Real Computation and ComplexityThomas Lickteig, Klaus Meer, Luis Miguel Pardo. Dagstuhl 2006: [doi]

Deformation techniques to solve generalised Pham systemsLuis Miguel Pardo, Jorge San Martín. TCS, 315(2-3):593-625, 2004. [doi]

2003

The Hardness of Polynomial Equation SolvingD. Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo. focm, 3(4):347-420, 2003. [doi]

Systems of rational polynomial equations have polynomial size approximate zeros on the averageD. Castro, Luis Miguel Pardo, Jorge San Martín. jc, 19(2):161-209, 2003. [doi]

PrefaceMarc Giusti, Luis Miguel Pardo. JSC, 36(3-4):287, 2003. [doi]

2002

The Distribution of Condition Numbers of Rational Data of Bounded Bit LengthD. Castro, José Luis Montaña, Luis Miguel Pardo, Jorge San Martín. focm, 2(1):1-52, 2002. [doi]

2001

A new method to obtain lower bounds for polynomial evaluationMikel Aldaz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo. TCS, 259(1-2):577-596, 2001. [doi]

Kronecker s and Newton s Approaches to Solving: A First ComparisonD. Castro, Luis Miguel Pardo, Klemens Hägele, Jose Enrique Morais. jc, 17(1):212-303, 2001. [doi]

2000

Time-Space Tradeoffs in Algebraic Complexity TheoryMikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo. jc, 16(1):2-49, 2000. [doi]

1999

Arithmetic NullstellensätzeTeresa Krick, Luis Miguel Pardo, Martín Sombra. cca, 33(3):17, 1999. [doi]

1998

Combinatorial Hardness Proofs for Polynomial EvaluationMikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo. mfcs 1998: 167-175 [doi]

On Kolmogorov Complexity in the Real Turing Machine SettingJosé Luis Montaña, Luis Miguel Pardo. ipl, 67(2):81-86, 1998. [doi]

1995

When Polynomial Equation Systems Can Be Solved Fast?Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo. AAECC 1995: 205-231

Lower Bounds for Arithmetic Networks II: Sum of Betti NumbersJosé Luis Montaña, Jose Enrique Morais, Luis Miguel Pardo. aaecc, 7(1):41-51, 1995. [doi]

How Lower and Upper Complexity Bounds Meet in Elimination TheoryLuis Miguel Pardo. AAECC 1995: 33-69

1994

A Note on Rabin s Width of a Complete ProofJosé Luis Montaña, Luis Miguel Pardo, Tomás Recio. cc, 4:12-36, 1994.

1993

Lower Bounds for Arithmetic NetworksJosé Luis Montaña, Luis Miguel Pardo. aaecc, 4:1-24, 1993.

1987

On the Computation of the Local and Global Analytic Branches of a Real Algebraic CurveFelipe Cucker, Luis Miguel Pardo, Mario Raimondo, Tomás Recio, Marie-Françoise Roy. AAECC 1989: 161-181

Rabin s width of a complete proof and the width of a semialgebraic setTomás Recio, Luis Miguel Pardo. eurocal 1989: 456-462

Sign in or sign up to see more results.

runs on WebDSL