| Straight-line programs in geometric elimination theory M Giusti, J Heintz, JE Morais, J Morgenstem, LM Pardo Journal of pure and applied algebra 124 (1-3), 101-146, 1998 | 234 | 1998 |
| Sharp estimates for the arithmetic Nullstellensatz T Krick, LM Pardo, M Sombra | 199 | 2001 |
| Lower bounds for Diophantine approximations M Giusti, J Heintz, K Hägele, JE Morais, LM Pardo, JL Montana Journal of Pure and Applied Algebra 117, 277-317, 1997 | 181 | 1997 |
| When polynomial equation systems can be “solved” fast? M Giusti, J Heintz, JE Morais, LM Pardo Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 11th …, 1995 | 162 | 1995 |
| A computational method for diophantine approximation T Krick, LM Pardo Algorithms in algebraic geometry and applications, 193-253, 1996 | 145 | 1996 |
| Smale’s 17th problem: average polynomial time to compute affine and projective solutions C Beltrán, L Pardo Journal of the American Mathematical Society 22 (2), 363-385, 2009 | 95 | 2009 |
| Generalized polar varieties: Geometry and algorithms B Bank, M Giusti, J Heintz, LM Pardo Journal of complexity 21 (4), 377-412, 2005 | 94 | 2005 |
| How lower and upper complexity bounds meet in elimination theory LM Pardo International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 1995 | 89 | 1995 |
| The hardness of polynomial equation solving D Castro, M Giusti, J Heintz, G Matera, LM Pardo Foundations of Computational Mathematics 3, 347-420, 2003 | 80 | 2003 |
| Fast linear homotopy to find approximate zeros of polynomial systems C Beltrán, LM Pardo Foundations of Computational Mathematics 11 (1), 95-129, 2011 | 76 | 2011 |
| On Smale's 17th problem: a probabilistic positive solution C Beltrán, LM Pardo Foundations of Computational Mathematics 8, 1-43, 2008 | 66 | 2008 |
| Le rôle des structures de données dans les problèmes d'élimination M Giusti, J Heintz, JE Morais, LM Pardo Comptes Rendus de l'Académie des Sciences-Series I-Mathematics 325 (11 …, 1997 | 59 | 1997 |
| Generalized polar varieties and an efficient real elimination B Bank, M Giusti, J Heintz, LM Pardo Kybernetika 40 (5), [519]-550, 2004 | 56 | 2004 |
| Lower bounds for arithmetic networks JL Montana, LM Pardo Applicable Algebra in Engineering, Communication and Computing 4, 1-24, 1993 | 56 | 1993 |
| On the intrinsic complexity of the arithmetic Nullstellensatz K Hägele, JE Morais, LM Pardo, M Sombra Journal of Pure and Applied Algebra 146 (2), 103-183, 2000 | 50 | 2000 |
| Kronecker's and Newton's approaches to solving: a first comparison D Castro, LM Pardo, K Hägele, JE Morais Journal of complexity 17 (1), 212-303, 2001 | 47 | 2001 |
| Une approche informatique pour l'approximation diophantienne T Krick, LM Pardo Comptes rendus de l'Académie des sciences. Série 1, Mathématique 318 (5 …, 1994 | 47 | 1994 |
| Lower bounds for arithmetic networks II: Sum of Betti numbers JL Montaña, JE Morais, LM Pardo Applicable Algebra in Engineering, Communication and Computing 7, 41-51, 1996 | 31 | 1996 |
| The distribution of condition numbers of rational data of bounded bit length D Castro, JL Montaña, LM Pardo, J San Martín Foundations of Computational Mathematics 2, 1-52, 2002 | 29 | 2002 |
| Estimates on the distribution of the condition number of singular matrices C Beltrán, LM Pardo Foundations of Computational Mathematics 7 (1), 87-134, 2007 | 21 | 2007 |
Jose Luis MontañaProfesor de Informática, Universidad de CantabriaDirección de correo verificada de unican.es
