Joos Heintz - RankMe

62 papers A* 2B 3Journal 43Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Kronecker algorithm for locally closed sets over a perfect field. Appl. Algebra Eng. Commun. Comput. Nardo Giménez, Joos Heintz, Guillermo Matera, Luis Miguel Pardo, Mariana Pérez, Melina Privitelli
2025	J	`jnl`	A Kronecker algorithm for locally closed sets over a perfect field. CoRR Nardo Giménez, Joos Heintz, Guillermo Matera, Luis Miguel Pardo, Mariana Pérez, Melina Privitelli
2023	J	`jnl`	An unfeasibility view of neural network learning. J. Complex. Joos Heintz, Luis Miguel Pardo, Enrique Carlos Segura, Hvara Ocar, Andres Rojas Paredes
2022	J	`jnl`	An unfeasability view of neural network learning. CoRR Joos Heintz, Hvara Ocar, Luis Miguel Pardo, Andres Rojas Paredes, Enrique Carlos Segura
2021	J	`jnl`	On Bézout inequalities for non-homogeneous polynomial ideals. J. Symb. Comput. Amir Hashemi, Joos Heintz, Luis M. Pardo, Pablo Solernó
2020	B	`conf`	Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases. CASC Amir Hashemi, Joos Heintz, Luis M. Pardo, Pablo Solernó
2017	J	`jnl`	On Bezout Inequalities for non-homogeneous Polynomial Ideals. CoRR Amir Hashemi, Joos Heintz, Luis Miguel Pardo, Pablo Solernó
2016	J	`jnl`	Quiz games as a model for information hiding. J. Complex. Bernd Bank, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis M. Pardo, Andres Rojas Paredes
2015	J	`jnl`	Degeneracy Loci and Polynomial Equation Solving. Found. Comput. Math. Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó
2014	J	`jnl`	Intrinsic complexity estimates in polynomial optimization. J. Complex. Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din
2014	J	`jnl`	Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity. Math. Comput. Bernd Bank, Marc Giusti, Joos Heintz
2013	J	`jnl`	Degeneracy loci and polynomial equation solving. CoRR Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, Pablo Solernó
2013	J	`jnl`	Intrinsic complexity estimates in polynomial optimization CoRR Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din
2013	J	`jnl`	Software Engineering and complexity in effective Algebraic Geometry. J. Complex. Joos Heintz, Bart Kuijpers, Andres Rojas Paredes
2012	J	`jnl`	Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces. Found. Comput. Math. Bernd Bank, Marc Giusti, Joos Heintz, Lutz Lehmann, Luis Miguel Pardo
2012	J	`jnl`	Evaluating geometric queries using few arithmetic operations. Appl. Algebra Eng. Commun. Comput. Rafael Grimson, Joos Heintz, Bart Kuijpers
2012	J	`jnl`	On the intrinsic complexity of elimination problems in effective Algebraic Geometry CoRR Joos Heintz, Bart Kuijpers, Andres Rojas Paredes
2011	J	`jnl`	Efficient evaluation of specific queries in constraint databases. Inf. Process. Lett. Rafael Grimson, Joos Heintz, Bart Kuijpers
2011	J	`jnl`	Evaluating geometric queries using few arithmetic operations CoRR Rafael Grimson, Joos Heintz, Bart Kuijpers
2011	J	`jnl`	Lower complexity bounds for interpolation algorithms. J. Complex. Nardo Giménez, Joos Heintz, Guillermo Matera, Pablo Solernó
2011	J	`jnl`	Software Engineering and Complexity in Effective Algebraic Geometry CoRR Joos Heintz, Bart Kuijpers, Andres Rojas Paredes
2011	J	`jnl`	The evaluation of geometric queries: constraint databases and quantifier elimination CoRR Marc Giusti, Joos Heintz, Bart Kuijpers
2010	J	`jnl`	On the geometry of polar varieties. Appl. Algebra Eng. Commun. Comput. Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost
2009	J	`jnl`	On the intrinsic complexity of point finding in real singular hypersurfaces. Inf. Process. Lett. Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo
2007	—	`conf`	07212 Manifesto -- Constraint Databases, Geometric Elimination ang Geographic Information Systems. Constraint Databases, Geometric Elimination and Geographic Information Systems Bernd Bank, Max J. Egenhofer, Joos Heintz, Bart Kuijpers, Peter Z. Revesz
2005	J	`jnl`	Generalized polar varieties: geometry and algorithms. J. Complex. Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo
2004	—	`conf`	Constraint Databases, Data Structures and Efficient Query Evaluation. CDB Joos Heintz, Bart Kuijpers
2004	J	`jnl`	Generalized polar varieties and an efficient real elimination. Kybernetika Bernd Bank, Marc Giusti, Joos Heintz, Luis M. Pardo
2003	J	`jnl`	The Hardness of Polynomial Equation Solving. Found. Comput. Math. David Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo
2002	J	`jnl`	Functional programming concepts and straight-line programs in computer algebra. Math. Comput. Simul. N. Bruno, Joos Heintz, Guillermo Matera, Rosita Wachenchauzer
2001	J	`jnl`	On the Time-Space Complexity of Geometric Elimination Procedures. Appl. Algebra Eng. Commun. Comput. Joos Heintz, Guillermo Matera, Ariel Waissbein
2000	J	`jnl`	Deformation Techniques for Efficient Polynomial Equation Solving. J. Complex. Joos Heintz, Teresa Krick, Susana Puddu, Juan Sabia, Ariel Waissbein
2000	J	`jnl`	Time-Space Tradeoffs in Algebraic Complexity Theory. J. Complex. Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
1999	—	`conf`	OpTERA - Optimization and Real Equation Solving. German-Argentinian Workshop on Information Technology Bernd Bank, Joos Heintz, Lutz Lehmann, Guillermo Matera, Guy M. Mbakop, Rosita Wachenchauzer, Ariel Waissbein
1998	B	`conf`	Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
1997	J	`jnl`	Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case. J. Complex. Bernd Bank, Marc Giusti, Joos Heintz, Guy M. Mbakop
1995	—	`conf`	When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo
1994	J	`jnl`	Description of the Connected Components of a Semialgebraic in Single Exponential Time. Discret. Comput. Geom. Joos Heintz, Marie-Françoise Roy, Pablo Solernó
1993	J	`jnl`	(Working Group Noaï Fitchas) Algorithmic Aspects of Suslin's Proof of Serre's Conjecture. Comput. Complex. Leandro Caniglia, Guillermo Cortiñas, Silvia Danón, Joos Heintz, Teresa Krick, Pablo Solernó
1993	J	`jnl`	On the Efficiency of Effective Nullstellensätze. Comput. Complex. Marc Giusti, Joos Heintz, Juan Sabia
1993	J	`jnl`	On the Intrinsic Complexity of Elimination Theory. J. Complex. Joos Heintz, Jacques Morgenstern
1993	J	`jnl`	On the Theoretical and Practical Complexity of the Existential Theory of Reals. Comput. J. Joos Heintz, Marie-Françoise Roy, Pablo Solernó
1991	J	`jnl`	Equations for the projective closure and effective Nullstellensatz. Discret. Appl. Math. Leandro Caniglia, André Galligo, Joos Heintz
1990	—	`conf`	Algorithms in Real Algebraic Geometry and Applications to Computational Geometry. Discrete and Computational Geometry Joos Heintz, Tomás Recio, Marie-Françoise Roy
1990	—	`conf`	Geometric Problems Solvable in Single Exponential Time. AAECC Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó
1990	—	`conf`	Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface. AAECC Joos Heintz, Marie-Françoise Roy, Pablo Solernó
1989	—	`conf`	On the Complexity of Semialgebraic Sets. IFIP Congress Joos Heintz, Pablo Solernó, Marie-Françoise Roy
1988	J	`jnl`	Real Quantifier Elimination is Doubly Exponential. J. Symb. Comput. James H. Davenport, Joos Heintz
1988	—	`conf`	Some New Effectivity Bounds in Computational Geometry. AAECC Leandro Caniglia, André Galligo, Joos Heintz
1987	B	`conf`	On the Complexity of Lie Algebras. FCT Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt
1987	—	`conf`	On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey. AAECC Joos Heintz
1986	J	`jnl`	On Polynomials with Symmetric Galois Group which Are Easy to Compute. Theor. Comput. Sci. Joos Heintz
1985	—	`conf`	A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. AAECC Hans F. de Groote, Joos Heintz
1985	J	`jnl`	Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. Joos Heintz
1984	—	`conf`	On associative algebras of minimal rank. AAECC Joos Heintz, Jacques Morgenstern
1983	J	`jnl`	Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. Joos Heintz
1981	A*	`conf`	Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. ICALP Joos Heintz, Malte Sieveking
1980	J	`jnl`	Lower Bounds for Polynomials with Algebraic Coefficients. Theor. Comput. Sci. Joos Heintz, Malte Sieveking
1980	A*	`conf`	Testing Polynomials which Are Easy to Compute (Extended Abstract) STOC Joos Heintz, Claus-Peter Schnorr
1979	—	`conf`	A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. Theoretical Computer Science Joos Heintz
1976	—	`conf`	Untere Schranken für die Komplexität logischer Entscheidungsprobleme. Komplexität von Entscheidungsproblemen 1976 Joos Heintz
1975	J	`jnl`	An efficient quantifier elimination algorithm for algebraically closed fields of any characteristic. SIGSAM Bull. Joos Heintz, H. R. Wüthrich