default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoos Heintz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j33]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
- [i9]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
- [j32]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
- [c18]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
- [i8]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) - 2015
- [j30]Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó:
Degeneracy Loci and Polynomial Equation Solving. Found. Comput. Math. 15(1): 159-184 (2015) - 2014
- [j29]Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din:
Intrinsic complexity estimates in polynomial optimization. J. Complex. 30(4): 430-443 (2014) - [j28]Bernd Bank, Marc Giusti, Joos Heintz:
Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity. Math. Comput. 83(286): 873-897 (2014) - 2013
- [j27]Joos Heintz, Bart Kuijpers, Andres Rojas Paredes:
Software Engineering and complexity in effective Algebraic Geometry. J. Complex. 29(1): 92-138 (2013) - [i7]Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din:
Intrinsic complexity estimates in polynomial optimization. CoRR abs/1304.5214 (2013) - [i6]Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó:
Degeneracy loci and polynomial equation solving. CoRR abs/1306.3390 (2013) - 2012
- [j26]Rafael Grimson, Joos Heintz, Bart Kuijpers:
Evaluating geometric queries using few arithmetic operations. Appl. Algebra Eng. Commun. Comput. 23(3-4): 179-193 (2012) - [j25]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) - [i5]Joos Heintz, Bart Kuijpers, Andres Rojas Paredes:
On the intrinsic complexity of elimination problems in effective Algebraic Geometry. CoRR abs/1201.4344 (2012) - 2011
- [j24]Rafael Grimson, Joos Heintz, Bart Kuijpers:
Efficient evaluation of specific queries in constraint databases. Inf. Process. Lett. 111(19): 941-944 (2011) - [j23]Nardo Giménez, Joos Heintz, Guillermo Matera, Pablo Solernó:
Lower complexity bounds for interpolation algorithms. J. Complex. 27(2): 151-187 (2011) - [i4]Marc Giusti, Joos Heintz, Bart Kuijpers:
The evaluation of geometric queries: constraint databases and quantifier elimination. CoRR abs/1110.2196 (2011) - [i3]Joos Heintz, Bart Kuijpers, Andres Rojas Paredes:
Software Engineering and Complexity in Effective Algebraic Geometry. CoRR abs/1110.3030 (2011) - [i2]Rafael Grimson, Joos Heintz, Bart Kuijpers:
Evaluating geometric queries using few arithmetic operations. CoRR abs/1111.0499 (2011) - 2010
- [j22]Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost:
On the geometry of polar varieties. Appl. Algebra Eng. Commun. Comput. 21(1): 33-83 (2010)
2000 – 2009
- 2009
- [j21]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) - 2007
- [i1]Bernd Bank, Max J. Egenhofer, Joos Heintz, Bart Kuijpers, Peter Z. Revesz:
07212 Manifesto -- Constraint Databases, Geometric Elimination ang Geographic Information Systems. Constraint Databases, Geometric Elimination and Geographic Information Systems 2007 - 2005
- [j20]Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo:
Generalized polar varieties: geometry and algorithms. J. Complex. 21(4): 377-412 (2005) - 2004
- [j19]Bernd Bank, Marc Giusti, Joos Heintz, Luis M. Pardo:
Generalized polar varieties and an efficient real elimination. Kybernetika 40(5): 519-550 (2004) - [c17]Joos Heintz, Bart Kuijpers:
Constraint Databases, Data Structures and Efficient Query Evaluation. CDB 2004: 1-24 - 2003
- [j18]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) - 2002
- [j17]N. Bruno, Joos Heintz, Guillermo Matera, Rosita Wachenchauzer:
Functional programming concepts and straight-line programs in computer algebra. Math. Comput. Simul. 60(6): 423-473 (2002) - 2001
- [j16]Joos Heintz, Guillermo Matera, Ariel Waissbein:
On the Time-Space Complexity of Geometric Elimination Procedures. Appl. Algebra Eng. Commun. Comput. 11(4): 239-296 (2001) - 2000
- [j15]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) - [j14]Joos Heintz, Teresa Krick, Susana Puddu, Juan Sabia, Ariel Waissbein:
Deformation Techniques for Efficient Polynomial Equation Solving. J. Complex. 16(1): 70-109 (2000)
1990 – 1999
- 1999
- [c16]Bernd Bank, Joos Heintz, Lutz Lehmann, Guillermo Matera, Guy M. Mbakop, Rosita Wachenchauzer, Ariel Waissbein:
OpTERA - Optimization and Real Equation Solving. German-Argentinian Workshop on Information Technology 1999: 69-72 - 1998
- [c15]Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo:
Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS 1998: 167-175 - 1997
- [j13]Bernd Bank, Marc Giusti, Joos Heintz, Guy M. Mbakop:
Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case. J. Complex. 13(1): 5-27 (1997) - 1995
- [c14]Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo:
When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC 1995: 205-231 - 1994
- [j12]Joos Heintz, Marie-Françoise Roy, Pablo Solernó:
Description of the Connected Components of a Semialgebraic in Single Exponential Time. Discret. Comput. Geom. 11: 121-140 (1994) - 1993
- [j11]Leandro Caniglia, Guillermo Cortiñas, Silvia Danón, Joos Heintz, Teresa Krick, Pablo Solernó:
(Working Group Noaï Fitchas) Algorithmic Aspects of Suslin's Proof of Serre's Conjecture. Comput. Complex. 3: 31-55 (1993) - [j10]Marc Giusti, Joos Heintz, Juan Sabia:
On the Efficiency of Effective Nullstellensätze. Comput. Complex. 3: 56-95 (1993) - [j9]Joos Heintz, Marie-Françoise Roy, Pablo Solernó:
On the Theoretical and Practical Complexity of the Existential Theory of Reals. Comput. J. 36(5): 427-431 (1993) - [j8]Joos Heintz, Jacques Morgenstern:
On the Intrinsic Complexity of Elimination Theory. J. Complex. 9(4): 471-498 (1993) - 1991
- [j7]Leandro Caniglia, André Galligo, Joos Heintz:
Equations for the projective closure and effective Nullstellensatz. Discret. Appl. Math. 33(1-3): 11-23 (1991) - 1990
- [c13]Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó:
Geometric Problems Solvable in Single Exponential Time. AAECC 1990: 11-23 - [c12]Joos Heintz, Marie-Françoise Roy, Pablo Solernó:
Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface. AAECC 1990: 180-196 - [c11]Joos Heintz, Tomás Recio, Marie-Françoise Roy:
Algorithms in Real Algebraic Geometry and Applications to Computational Geometry. Discrete and Computational Geometry 1990: 137-164
1980 – 1989
- 1989
- [c10]Joos Heintz, Pablo Solernó, Marie-Françoise Roy:
On the Complexity of Semialgebraic Sets. IFIP Congress 1989: 293-298 - 1988
- [j6]James H. Davenport, Joos Heintz:
Real Quantifier Elimination is Doubly Exponential. J. Symb. Comput. 5(1/2): 29-35 (1988) - [c9]Leandro Caniglia, André Galligo, Joos Heintz:
Some New Effectivity Bounds in Computational Geometry. AAECC 1988: 131-151 - 1987
- [c8]Joos Heintz:
On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey. AAECC 1987: 269-300 - [c7]Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt:
On the Complexity of Lie Algebras. FCT 1987: 172-179 - 1986
- [j5]Joos Heintz:
On Polynomials with Symmetric Galois Group which Are Easy to Compute. Theor. Comput. Sci. 47(3): 99-105 (1986) - 1985
- [j4]Joos Heintz:
Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. 39: 343 (1985) - [c6]Hans F. de Groote, Joos Heintz:
A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. AAECC 1985: 211-222 - 1984
- [c5]Joos Heintz, Jacques Morgenstern:
On associative algebras of minimal rank. AAECC 1984: 1-24 - 1983
- [j3]Joos Heintz:
Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. 24: 239-277 (1983) - 1981
- [c4]Joos Heintz, Malte Sieveking:
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. ICALP 1981: 16-28 - 1980
- [j2]Joos Heintz, Malte Sieveking:
Lower Bounds for Polynomials with Algebraic Coefficients. Theor. Comput. Sci. 11: 321-330 (1980) - [c3]Joos Heintz, Claus-Peter Schnorr:
Testing Polynomials which Are Easy to Compute (Extended Abstract). STOC 1980: 262-272
1970 – 1979
- 1979
- [c2]Joos Heintz:
A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. Theoretical Computer Science 1979: 153-157 - 1976
- [c1]Joos Heintz:
Untere Schranken für die Komplexität logischer Entscheidungsprobleme. Komplexität von Entscheidungsproblemen 1976 1976: 127-137 - 1975
- [j1]Joos Heintz, H. R. Wüthrich:
An efficient quantifier elimination algorithm for algebraically closed fields of any characteristic. SIGSAM Bull. 9(4): 11 (1975)
Coauthor Index
aka: Luis Miguel Pardo
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-04-25 05:47 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:
