default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis M. Pardo
- > Home > Persons > Luis M. Pardo
Publications
- 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
- [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
- [c9]Amir Hashemi, Joos Heintz, Luis M. Pardo, Pablo Solernó:
Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases. CASC 2020: 245-265 - 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
- [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) - 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) - 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) - 2005
- [j16]Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo:
Generalized polar varieties: geometry and algorithms. J. Complex. 21(4): 377-412 (2005) - 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) - 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) - 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) - 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
- [c3]Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo:
When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC 1995: 205-231
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:
