The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Joos Heintz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James H. Davenport, Joos Heintz
    Real Quantifier Elimination is Doubly Exponential. [Citation Graph (1, 0)][DBLP]
    J. Symb. Comput., 1988, v:5, n:1/2, pp:29-35 [Journal]
  2. Leandro Caniglia, André Galligo, Joos Heintz
    Some New Effectivity Bounds in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    AAECC, 1988, pp:131-151 [Conf]
  3. Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo
    When Polynomial Equation Systems Can Be "Solved" Fast?. [Citation Graph (0, 0)][DBLP]
    AAECC, 1995, pp:205-231 [Conf]
  4. Hans F. de Groote, Joos Heintz
    A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. [Citation Graph (0, 0)][DBLP]
    AAECC, 1985, pp:211-222 [Conf]
  5. Joos Heintz
    On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey. [Citation Graph (0, 0)][DBLP]
    AAECC, 1987, pp:269-300 [Conf]
  6. Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó
    Geometric Problems Solvable in Single Exponential Time. [Citation Graph (0, 0)][DBLP]
    AAECC, 1990, pp:11-23 [Conf]
  7. Joos Heintz, Jacques Morgenstern
    On associative algebras of minimal rank. [Citation Graph (0, 0)][DBLP]
    AAECC, 1984, pp:1-24 [Conf]
  8. Joos Heintz, Marie-Françoise Roy, Pablo Solernó
    Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface. [Citation Graph (0, 0)][DBLP]
    AAECC, 1990, pp:180-196 [Conf]
  9. Joos Heintz
    Untere Schranken für die Komplexität logischer Entscheidungsprobleme. [Citation Graph (0, 0)][DBLP]
    Komplexität von Entscheidungsproblemen 1976, 1976, pp:127-137 [Conf]
  10. Joos Heintz, Bart Kuijpers
    Constraint Databases, Data Structures and Efficient Query Evaluation. [Citation Graph (0, 0)][DBLP]
    CDB, 2004, pp:1-24 [Conf]
  11. Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt
    On the Complexity of Lie Algebras. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:172-179 [Conf]
  12. Bernd Bank, Joos Heintz, Lutz Lehmann, Guillermo Matera, Guy M. Mbakop, Rosita Wachenchauzer, Ariel Waissbein
    OpTERA - Optimization and Real Equation Solving. [Citation Graph (0, 0)][DBLP]
    German-Argentinian Workshop on Information Technology, 1999, pp:69-72 [Conf]
  13. Joos Heintz, Malte Sieveking
    Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:16-28 [Conf]
  14. Joos Heintz, Pablo Solernó, Marie-Françoise Roy
    On the Complexity of Semialgebraic Sets. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:293-298 [Conf]
  15. Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    Combinatorial Hardness Proofs for Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:167-175 [Conf]
  16. Joos Heintz, Claus-Peter Schnorr
    Testing Polynomials which Are Easy to Compute (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:262-272 [Conf]
  17. Joos Heintz
    A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:153-157 [Conf]
  18. Joos Heintz, Guillermo Matera, Ariel Waissbein
    On the Time-Space Complexity of Geometric Elimination Procedures. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2001, v:11, n:4, pp:239-296 [Journal]
  19. Marc Giusti, Joos Heintz, Juan Sabia
    On the Efficiency of Effective Nullstellensätze. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:56-95 [Journal]
  20. 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. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:31-55 [Journal]
  21. Joos Heintz, Marie-Françoise Roy, Pablo Solernó
    On the Theoretical and Practical Complexity of the Existential Theory of Reals. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:5, pp:427-431 [Journal]
  22. Joos Heintz, Marie-Françoise Roy, Pablo Solernó
    Description of the Connected Components of a Semialgebraic in Single Exponential Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:121-140 [Journal]
  23. D. Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo
    The Hardness of Polynomial Equation Solving. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2003, v:3, n:4, pp:347-420 [Journal]
  24. Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    Time-Space Tradeoffs in Algebraic Complexity Theory. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:2-49 [Journal]
  25. Bernd Bank, Marc Giusti, Joos Heintz, Guy M. Mbakop
    Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:5-27 [Journal]
  26. Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo
    Generalized polar varieties: geometry and algorithms. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:377-412 [Journal]
  27. Joos Heintz, Teresa Krick, Susana Puddu, Juan Sabia, Ariel Waissbein
    Deformation Techniques for Efficient Polynomial Equation Solving. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:70-109 [Journal]
  28. Joos Heintz, Jacques Morgenstern
    On the Intrinsic Complexity of Elimination Theory. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:4, pp:471-498 [Journal]
  29. Joos Heintz
    Definability and Fast Quantifier Elimination in Algebraically Closed Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:24, n:, pp:239-277 [Journal]
  30. Joos Heintz
    Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:343- [Journal]
  31. Joos Heintz
    On Polynomials with Symmetric Galois Group which Are Easy to Compute. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:99-105 [Journal]
  32. Joos Heintz, Malte Sieveking
    Lower Bounds for Polynomials with Algebraic Coefficients. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:321-330 [Journal]

  33. 07212 Manifesto -- Constraint Databases, Geometric Elimination ang Geographic Information Systems. [Citation Graph (, )][DBLP]


  34. On the geometry of polar varieties. [Citation Graph (, )][DBLP]


  35. Equations for the projective closure and effective Nullstellensatz. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.301secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002