default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis M. Pardo
Person information
- affiliation: University of Cantabria, Santander, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Luis M. Pardo:
Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics. Appl. Algebra Eng. Commun. Comput. 35(1): 71-118 (2024)- 2023
- [j36]Joos Heintz, Luis Miguel Pardo, Enrique Carlos Segura, Hvara Ocar, Andres Rojas Paredes:
An unfeasibility view of neural network learning. J. Complex. 75: 101710 (2023) - 2022
- [j35]Luis M. Pardo
, Daniel Sebastián:
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density. J. Complex. 68: 101588 (2022) - [i4]Joos Heintz, Hvara Ocar, Luis Miguel Pardo, Andres Rojas Paredes, Enrique Carlos Segura:
An unfeasability view of neural network learning. CoRR abs/2201.00945 (2022) - 2021
- [j34]Amir Hashemi, Joos Heintz, Luis M. Pardo, Pablo Solernó:
On Bézout inequalities for non-homogeneous polynomial ideals. J. Symb. Comput. 106: 1-22 (2021) - 2020
- [j33]Cristina Bertone, Francesca Cioffi, Luis M. Pardo:
Special Issue: "Algebraic Geometry from an Algorithmic Point of View", ACA 2019, Montréal, Canada, July 16-20, 2019. Appl. Algebra Eng. Commun. Comput. 31(5-6): 323-324 (2020) - [c9]Amir Hashemi, Joos Heintz, Luis M. Pardo, Pablo Solernó:
Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases. CASC 2020: 245-265
2010 – 2019
- 2017
- [i3]Amir Hashemi, Joos Heintz, Luis Miguel Pardo, Pablo Solernó:
On Bezout Inequalities for non-homogeneous Polynomial Ideals. CoRR abs/1701.04341 (2017) - 2016
- [j32]Luis M. Pardo, Mario Pardo:
On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant. Appl. Algebra Eng. Commun. Comput. 27(4): 303-358 (2016) - [j31]Bernd Bank, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis M. Pardo, Andres Rojas Paredes:
Quiz games as a model for information hiding. J. Complex. 34: 1-29 (2016) - [j30]Cristina Tîrnauca, José L. Montaña, Santiago Ontañón, Avelino J. Gonzalez, Luis M. Pardo:
Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study. Sensors 16(7): 958 (2016) - 2014
- [c8]Cruz E. Borges, José Luis Montaña, Luis M. Pardo:
A Sharp Fitness Function for the Problem of Finding Roots of Polynomial Equations Systems. IJCCI (ECTA) 2014: 294-301 - 2013
- [j29]Mario Fernández, Luis M. Pardo:
An Arithmetic Poisson Formula for the multi-variate resultant. J. Complex. 29(5): 323-350 (2013) - 2012
- [j28]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): 75-122 (2012) - [j27]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): 388-421 (2012) - 2011
- [j26]Carlos Beltrán, Luis Miguel Pardo:
Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems. Found. Comput. Math. 11(1): 95-129 (2011) - 2010
- [j25]Carlos D'Andrea, Marc Giusti, Luis M. Pardo, Ragni Piene:
Effective methods in algebraic geometry 2009: Barcelona. Guest editors' foreword. J. Symb. Comput. 45(12): 1251-1253 (2010)
2000 – 2009
- 2009
- [j24]José L. Montaña, Luis M. Pardo:
On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations. Ann. Math. Artif. Intell. 56(3-4): 371-388 (2009) - [j23]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): 1141-1144 (2009) - [j22]André Galligo, Luis Miguel Pardo, Josef Schicho:
Effective methods in algebraic geometry. J. Symb. Comput. 44(9): 1087-1088 (2009) - 2008
- [j21]Carlos Beltrán, Luis Miguel Pardo:
On Smale's 17th Problem: A Probabilistic Positive Solution. Found. Comput. Math. 8(1): 1-43 (2008) - [j20]Cruz E. Borges, Luis M. Pardo:
On the probability distribution of data at points in real complete intersection varieties. J. Complex. 24(4): 492-523 (2008) - [c7]José Luis Montaña, Luis Miguel Pardo, Mar Callau:
VC Dimension Bounds for Analytic Algebraic Computations. COCOON 2008: 62-71 - 2007
- [j19]Carlos Beltrán, Luis Miguel Pardo:
Estimates on the Distribution of the Condition Number of Singular Matrices. Found. Comput. Math. 7(1): 87-134 (2007) - [j18]Carlos Beltrán, Luis Miguel Pardo:
On the probability distribution of singular varieties of given corank. J. Symb. Comput. 42(1-2): 4-29 (2007) - [j17]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): 1393-1424 (2007) - 2006
- [e1]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
Real Computation and Complexity, 1.-6. February 2004. Dagstuhl Seminar Proceedings 04061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - 2005
- [j16]Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo:
Generalized polar varieties: geometry and algorithms. J. Complex. 21(4): 377-412 (2005) - [c6]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: 83-94 - 2004
- [j15]Bernd Bank, Marc Giusti, Joos Heintz, Luis M. Pardo:
Generalized polar varieties and an efficient real elimination. Kybernetika 40(5): 519-550 (2004) - [j14]Luis Miguel Pardo, Jorge San Martín:
Deformation techniques to solve generalised Pham systems. Theor. Comput. Sci. 315(2-3): 593-625 (2004) - [i2]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
04061 Summary - Real Computation and Complexity. Real Computation and Complexity 2004 - [i1]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity 2004 - 2003
- [j13]David Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo:
The Hardness of Polynomial Equation Solving. Found. Comput. Math. 3(4): 347-420 (2003) - [j12]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): 161-209 (2003) - [j11]Marc Giusti, Luis Miguel Pardo:
Preface. J. Symb. Comput. 36(3-4): 287 (2003) - 2002
- [j10]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): 1-52 (2002) - 2001
- [j9]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): 212-303 (2001) - [j8]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): 577-596 (2001) - 2000
- [j7]Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo:
Time-Space Tradeoffs in Algebraic Complexity Theory. J. Complex. 16(1): 2-49 (2000)
1990 – 1999
- 1999
- [j6]Teresa Krick, Luis Miguel Pardo, Martín Sombra:
Arithmetic Nullstellensätze. SIGSAM Bull. 33(3): 17 (1999) - 1998
- [j5]José Luis Montaña, Luis Miguel Pardo:
On Kolmogorov Complexity in the Real Turing Machine Setting. Inf. Process. Lett. 67(2): 81-86 (1998) - [c5]Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo:
Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS 1998: 167-175 - 1995
- [j4]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): 41-51 (1995) - [c4]Luis Miguel Pardo:
How Lower and Upper Complexity Bounds Meet in Elimination Theory. AAECC 1995: 33-69 - [c3]Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo:
When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC 1995: 205-231 - 1994
- [j3]José Luis Montaña, Luis Miguel Pardo, Tomás Recio:
A Note on Rabin's Width of a Complete Proof. Comput. Complex. 4: 12-36 (1994) - 1993
- [j2]José Luis Montaña, Luis Miguel Pardo:
Lower Bounds for Arithmetic Networks. Appl. Algebra Eng. Commun. Comput. 4: 1-24 (1993) - 1992
- [j1]Felipe Cucker, José L. Montaña, Luis M. Pardo:
Time Bounded Computations over the Reals. Int. J. Algebra Comput. 2(4): 395-408 (1992)
1980 – 1989
- 1987
- [c2]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: 161-181 - [c1]Tomás Recio, Luis Miguel Pardo:
Rabin's width of a complete proof and the width of a semialgebraic set. EUROCAL 1987: 456-462
Coauthor Index
aka: José L. Montaña
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
