Luis M. Pardo
Orcid: 0000-0003-2715-4432Affiliations:
- University of Cantabria, Santander, Spain
According to our database1,
Luis M. Pardo
authored at least 49 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics.
Appl. Algebra Eng. Commun. Comput., January, 2024
2023
2022
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density.
J. Complex., 2022
2021
2020
Special Issue: "Algebraic Geometry from an Algorithmic Point of View", ACA 2019, Montréal, Canada, July 16-20, 2019.
Appl. Algebra Eng. Commun. Comput., 2020
Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020
2016
Sensors, 2016
On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant.
Appl. Algebra Eng. Commun. Comput., 2016
2014
A Sharp Fitness Function for the Problem of Finding Roots of Polynomial Equations Systems.
Proceedings of the ECTA 2014, 2014
2013
2012
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian.
J. Complex., 2012
Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces.
Found. Comput. Math., 2012
2011
Found. Comput. Math., 2011
2010
J. Symb. Comput., 2010
2009
Inf. Process. Lett., 2009
On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations.
Ann. Math. Artif. Intell., 2009
2008
On the probability distribution of data at points in real complete intersection varieties.
J. Complex., 2008
Found. Comput. Math., 2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
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 case.
Math. Comput., 2007
J. Symb. Comput., 2007
Found. Comput. Math., 2007
2005
On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
2004
Proceedings of the Real Computation and Complexity, 1.-6. February 2004, 2004
Proceedings of the Real Computation and Complexity, 1.-6. February 2004, 2004
2003
Systems of rational polynomial equations have polynomial size approximate zeros on the average.
J. Complex., 2003
2002
Found. Comput. Math., 2002
2001
Theor. Comput. Sci., 2001
J. Complex., 2001
2000
1999
1998
Inf. Process. Lett., 1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1995
Appl. Algebra Eng. Commun. Comput., 1995
Proceedings of the Applied Algebra, 1995
Proceedings of the Applied Algebra, 1995
1994
1993
1992
1987
Proceedings of the EUROCAL '87, 1987
On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve.
Proceedings of the Applied Algebra, 1987