Joos Heintz

Publication Activity (10 Years)

Years Active: 1975-2023
Publications (10 Years): 6

Top Topics

Intrinsic Complexity

Numerically Stable

Software Engineering

Top Venues

Found. Comput. Math.

Publications

Joos Heintz, Luis Miguel Pardo, Enrique Carlos Segura, Hvara Ocar, Andres Rojas Paredes
An unfeasibility view of neural network learning. J. Complex. 75 (2023)
Joos Heintz, Hvara Ocar, Luis Miguel Pardo, Andres Rojas Paredes, Enrique Carlos Segura
An unfeasability view of neural network learning. CoRR (2022)
Amir Hashemi, Joos Heintz, Luis M. Pardo, Pablo Solernó
On Bézout inequalities for non-homogeneous polynomial ideals. J. Symb. Comput. 106 (2021)
Amir Hashemi, Joos Heintz, Luis M. Pardo, Pablo Solernó
Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases. CASC (2020)
Amir Hashemi, Joos Heintz, Luis Miguel Pardo, Pablo Solernó
On Bezout Inequalities for non-homogeneous Polynomial Ideals. CoRR (2017)
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 (2016)
Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó
Degeneracy Loci and Polynomial Equation Solving. Found. Comput. Math. 15 (1) (2015)
Bernd Bank, Marc Giusti, Joos Heintz
Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity. Math. Comput. 83 (286) (2014)
Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din
Intrinsic complexity estimates in polynomial optimization. J. Complex. 30 (4) (2014)
Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din
Intrinsic complexity estimates in polynomial optimization CoRR (2013)
Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó
Degeneracy loci and polynomial equation solving. CoRR (2013)
Joos Heintz, Bart Kuijpers, Andres Rojas Paredes
Software Engineering and complexity in effective Algebraic Geometry. J. Complex. 29 (1) (2013)
Joos Heintz, Bart Kuijpers, Andres Rojas Paredes
On the intrinsic complexity of elimination problems in effective Algebraic Geometry CoRR (2012)
Rafael Grimson, Joos Heintz, Bart Kuijpers
Evaluating geometric queries using few arithmetic operations. Appl. Algebra Eng. Commun. Comput. 23 (3-4) (2012)
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) (2012)
Joos Heintz, Bart Kuijpers, Andres Rojas Paredes
Software Engineering and Complexity in Effective Algebraic Geometry CoRR (2011)
Rafael Grimson, Joos Heintz, Bart Kuijpers
Evaluating geometric queries using few arithmetic operations CoRR (2011)
Rafael Grimson, Joos Heintz, Bart Kuijpers
Efficient evaluation of specific queries in constraint databases. Inf. Process. Lett. 111 (19) (2011)
Nardo Giménez, Joos Heintz, Guillermo Matera, Pablo Solernó
Lower complexity bounds for interpolation algorithms. J. Complex. 27 (2) (2011)
Marc Giusti, Joos Heintz, Bart Kuijpers
The evaluation of geometric queries: constraint databases and quantifier elimination CoRR (2011)
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) (2010)
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) (2009)
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)
Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo
Generalized polar varieties: geometry and algorithms. J. Complex. 21 (4) (2005)
Bernd Bank, Marc Giusti, Joos Heintz, Luis M. Pardo
Generalized polar varieties and an efficient real elimination. Kybernetika 40 (5) (2004)
Joos Heintz, Bart Kuijpers
Constraint Databases, Data Structures and Efficient Query Evaluation. CDB (2004)
David Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo
The Hardness of Polynomial Equation Solving. Found. Comput. Math. 3 (4) (2003)
N. Bruno, Joos Heintz, Guillermo Matera, Rosita Wachenchauzer
Functional programming concepts and straight-line programs in computer algebra. Math. Comput. Simul. 60 (6) (2002)
Joos Heintz, Guillermo Matera, Ariel Waissbein
On the Time-Space Complexity of Geometric Elimination Procedures. Appl. Algebra Eng. Commun. Comput. 11 (4) (2001)
Joos Heintz, Teresa Krick, Susana Puddu, Juan Sabia, Ariel Waissbein
Deformation Techniques for Efficient Polynomial Equation Solving. J. Complex. 16 (1) (2000)
Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
Time-Space Tradeoffs in Algebraic Complexity Theory. J. Complex. 16 (1) (2000)
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)
Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS (1998)
Bernd Bank, Marc Giusti, Joos Heintz, Guy M. Mbakop
Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case. J. Complex. 13 (1) (1997)
Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo
When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC (1995)
Joos Heintz, Marie-Françoise Roy, Pablo Solernó
Description of the Connected Components of a Semialgebraic in Single Exponential Time. Discret. Comput. Geom. 11 (1994)
Joos Heintz, Jacques Morgenstern
On the Intrinsic Complexity of Elimination Theory. J. Complex. 9 (4) (1993)
Joos Heintz, Marie-Françoise Roy, Pablo Solernó
On the Theoretical and Practical Complexity of the Existential Theory of Reals. Comput. J. 36 (5) (1993)
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 (1993)
Marc Giusti, Joos Heintz, Juan Sabia
On the Efficiency of Effective Nullstellensätze. Comput. Complex. 3 (1993)
Leandro Caniglia, André Galligo, Joos Heintz
Equations for the projective closure and effective Nullstellensatz. Discret. Appl. Math. 33 (1-3) (1991)
Joos Heintz, Tomás Recio, Marie-Françoise Roy
Algorithms in Real Algebraic Geometry and Applications to Computational Geometry. Discrete and Computational Geometry (1990)
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)
Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó
Geometric Problems Solvable in Single Exponential Time. AAECC (1990)
Joos Heintz, Pablo Solernó, Marie-Françoise Roy
On the Complexity of Semialgebraic Sets. IFIP Congress (1989)
James H. Davenport, Joos Heintz
Real Quantifier Elimination is Doubly Exponential. J. Symb. Comput. 5 (1/2) (1988)
Leandro Caniglia, André Galligo, Joos Heintz
Some New Effectivity Bounds in Computational Geometry. AAECC (1988)
Joos Heintz
On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey. AAECC (1987)
Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt
On the Complexity of Lie Algebras. FCT (1987)
Joos Heintz
On Polynomials with Symmetric Galois Group which Are Easy to Compute. Theor. Comput. Sci. 47 (3) (1986)
Joos Heintz
Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. 39 (1985)
Hans F. de Groote, Joos Heintz
A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. AAECC (1985)
Joos Heintz, Jacques Morgenstern
On associative algebras of minimal rank. AAECC (1984)
Joos Heintz
Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. 24 (1983)
Joos Heintz, Malte Sieveking
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. ICALP (1981)
Joos Heintz, Malte Sieveking
Lower Bounds for Polynomials with Algebraic Coefficients. Theor. Comput. Sci. 11 (1980)
Joos Heintz, Claus-Peter Schnorr
Testing Polynomials which Are Easy to Compute (Extended Abstract) STOC (1980)
Joos Heintz
A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. Theoretical Computer Science (1979)
Joos Heintz
Untere Schranken für die Komplexität logischer Entscheidungsprobleme. Komplexität von Entscheidungsproblemen 1976 (1976)
Joos Heintz, H. R. Wüthrich
An efficient quantifier elimination algorithm for algebraically closed fields of any characteristic. SIGSAM Bull. 9 (4) (1975)