![]() | ![]() |
| 2012 | ||
|---|---|---|
| 44 | Joos Heintz, Bart Kuijpers, Andres Rojas Paredes: On the intrinsic complexity of elimination problems in effective Algebraic Geometry CoRR abs/1201.4344: (2012) | |
| 43 | Bernd Bank, Marc Giusti, Joos Heintz, Lutz Lehmann, Luis Miguel Pardo: Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces. Foundations of Computational Mathematics 12(1): 75-122 (2012) | |
| 2011 | ||
| 42 | Marc Giusti, Joos Heintz, Bart Kuijpers: The evaluation of geometric queries: constraint databases and quantifier elimination CoRR abs/1110.2196: (2011) | |
| 41 | Joos Heintz, Bart Kuijpers, Andres Rojas Paredes: Software Engineering and Complexity in Effective Algebraic Geometry CoRR abs/1110.3030: (2011) | |
| 40 | Rafael Grimson, Joos Heintz, Bart Kuijpers: Evaluating geometric queries using few arithmetic operations CoRR abs/1111.0499: (2011) | |
| 39 | Rafael Grimson, Joos Heintz, Bart Kuijpers: Efficient evaluation of specific queries in constraint databases. Inf. Process. Lett. 111(19): 941-944 (2011) | |
| 38 | Nardo Giménez, Joos Heintz, Guillermo Matera, Pablo Solernó: Lower complexity bounds for interpolation algorithms. J. Complexity 27(2): 151-187 (2011) | |
| 2010 | ||
| 37 | 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) | |
| 2009 | ||
| 36 | 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 | ||
| 35 | 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 | ||
| 34 | Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo: Generalized polar varieties: geometry and algorithms. J. Complexity 21(4): 377-412 (2005) | |
| 2004 | ||
| 33 | Joos Heintz, Bart Kuijpers: Constraint Databases, Data Structures and Efficient Query Evaluation. CDB 2004: 1-24 | |
| 2003 | ||
| 32 | D. Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo: The Hardness of Polynomial Equation Solving. Foundations of Computational Mathematics 3(4): 347-420 (2003) | |
| 2002 | ||
| 31 | N. Bruno, Joos Heintz, Guillermo Matera, Rosita Wachenchauzer: Functional programming concepts and straight-line programs in computer algebra. Mathematics and Computers in Simulation 60(6): 423-473 (2002) | |
| 2001 | ||
| 30 | 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 | ||
| 29 | Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo: Time-Space Tradeoffs in Algebraic Complexity Theory. J. Complexity 16(1): 2-49 (2000) | |
| 28 | Joos Heintz, Teresa Krick, Susana Puddu, Juan Sabia, Ariel Waissbein: Deformation Techniques for Efficient Polynomial Equation Solving. J. Complexity 16(1): 70-109 (2000) | |
| 1999 | ||
| 27 | 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 | ||
| 26 | Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo: Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS 1998: 167-175 | |
| 1997 | ||
| 25 | Bernd Bank, Marc Giusti, Joos Heintz, Guy M. Mbakop: Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case. J. Complexity 13(1): 5-27 (1997) | |
| 1995 | ||
| 24 | Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo: When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC 1995: 205-231 | |
| 1994 | ||
| 23 | Joos Heintz, Marie-Françoise Roy, Pablo Solernó: Description of the Connected Components of a Semialgebraic in Single Exponential Time. Discrete & Computational Geometry 11: 121-140 (1994) | |
| 1993 | ||
| 22 | 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) | |
| 21 | 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. Computational Complexity 3: 31-55 (1993) | |
| 20 | Marc Giusti, Joos Heintz, Juan Sabia: On the Efficiency of Effective Nullstellensätze. Computational Complexity 3: 56-95 (1993) | |
| 19 | Joos Heintz, Jacques Morgenstern: On the Intrinsic Complexity of Elimination Theory. J. Complexity 9(4): 471-498 (1993) | |
| 1991 | ||
| 18 | Leandro Caniglia, André Galligo, Joos Heintz: Equations for the projective closure and effective Nullstellensatz. Discrete Applied Mathematics 33(1-3): 11-23 (1991) | |
| 1990 | ||
| 17 | Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó: Geometric Problems Solvable in Single Exponential Time. AAECC 1990: 11-23 | |
| 16 | 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 | |
| 1989 | ||
| 15 | Joos Heintz, Pablo Solernó, Marie-Françoise Roy: On the Complexity of Semialgebraic Sets. IFIP Congress 1989: 293-298 | |
| 1988 | ||
| 14 | Leandro Caniglia, André Galligo, Joos Heintz: Some New Effectivity Bounds in Computational Geometry. AAECC 1988: 131-151 | |
| 13 | James H. Davenport, Joos Heintz: Real Quantifier Elimination is Doubly Exponential. J. Symb. Comput. 5(1/2): 29-35 (1988) | |
| 1987 | ||
| 12 | Joos Heintz: On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey. AAECC 1987: 269-300 | |
| 11 | Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt: On the Complexity of Lie Algebras. FCT 1987: 172-179 | |
| 1986 | ||
| 10 | Joos Heintz: On Polynomials with Symmetric Galois Group which Are Easy to Compute. Theor. Comput. Sci. 47(3): 99-105 (1986) | |
| 1985 | ||
| 9 | Hans F. de Groote, Joos Heintz: A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. AAECC 1985: 211-222 | |
| 8 | Joos Heintz: Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. 39: 343 (1985) | |
| 1984 | ||
| 7 | Joos Heintz, Jacques Morgenstern: On associative algebras of minimal rank. AAECC 1984: 1-24 | |
| 1983 | ||
| 6 | Joos Heintz: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. Theor. Comput. Sci. 24: 239-277 (1983) | |
| 1981 | ||
| 5 | Joos Heintz, Malte Sieveking: Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. ICALP 1981: 16-28 | |
| 1980 | ||
| 4 | Joos Heintz, Claus-Peter Schnorr: Testing Polynomials which Are Easy to Compute (Extended Abstract) STOC 1980: 262-272 | |
| 3 | Joos Heintz, Malte Sieveking: Lower Bounds for Polynomials with Algebraic Coefficients. Theor. Comput. Sci. 11: 321-330 (1980) | |
| 1979 | ||
| 2 | Joos Heintz: A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. Theoretical Computer Science 1979: 153-157 | |
| 1976 | ||
| 1 | Joos Heintz: Untere Schranken für die Komplexität logischer Entscheidungsprobleme. Komplexität von Entscheidungsproblemen 1976 1976: 127-137 | |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page