World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
30
Citations
3914
World Ranking
3516
National Ranking
6

Overview

Joos Heintz was a researcher affiliated with the University of Buenos Aires in Argentina. Their work spanned multiple intersecting fields, primarily focusing on Computer Science, Mathematics, and Engineering.

Their research contributions appeared across several subfields, emphasizing Artificial Intelligence, Computational Theory and Mathematics, Computational Mechanics, Algebra and Number Theory, and Geometry and Topology. This multidisciplinary focus informed studies addressing both theoretical and applied problems.

Heintz's main research topics included polynomial and algebraic computation, advanced numerical analysis techniques, neural networks and applications, commutative algebra and its applications, algebraic geometry and number theory, face and expression recognition, and fuzzy logic and control systems. These topics suggest an engagement with complex mathematical structures as well as practical algorithmic methods in AI and data interpretation.

Their recent publications included:

  • On Bézout inequalities for non-homogeneous polynomial ideals, 2020, Journal of Symbolic Computation
  • An unfeasibility view of neural network learning, 2022, Journal of Complexity
  • An unfeasability view of neural network learning, 2022, arXiv (Cornell University)

Heintz collaborated with several researchers regularly. Frequent coauthors included Luis Miguel Pardo, Amir Hashemi, Pablo Solernó, Enrique Carlos Segura, and Hvara Ocar. These collaborative relationships indicate a networked approach across topics related to symbolic computation, complexity theory, and applied mathematics.

Their publications appeared primarily in venues such as the Journal of Symbolic Computation, Journal of Complexity, and arXiv, indicating a combination of peer-reviewed and preprint dissemination channels.

Best Publications

  • Real quantifier elimination is doubly exponential

    James H. Davenport;Joos Heintz

  • Definability and fast quantifier elimination in algebraically closed fields

    Joos Heintz

  • Straight--Line Programs in Geometric Elimination Theory

    M. Giusti;J. Heintz;J.E. Morais;J. Morgenstem

  • Sur la complexité du principe de Tarski-Seidenberg

    Joos Heintz;Marie-Françoise Roy;Pablo Solernó

  • Lower bounds for diophantine approximations

    M. Giusti;J. Heintz;K. Hägele;J.E. Morais

  • Some New Effectivity Bounds in Computational Geometry

    Leandro Caniglia;André Galligo;André Galligo;Joos Heintz

  • When Polynomial Equation Systems Can Be Solved Fast

    Marc Giusti;Joos Heintz;Jose Enrique Morais;Luis M. Pardo

  • Polar varieties and efficient real elimination

    B. Bank;M. Giusti;J. Heintz;G.M. Mbakop

  • Algorithmes – disons rapides – pour la décomposition d’une variété algébrique en composantes irréductibles et équidimensionnelles

    Marc Giusti;Joos Heintz

  • On the Complexity of Semialgebraic Sets.

    Joos Heintz;Pablo Solernó;Marie-Françoise Roy

  • Generalized polar varieties: geometry and algorithms

    B. Bank;M. Giusti;J. Heintz;L. M. Pardo

  • On the efficiency of effective Nullstellensa¨tze

    Marc Giusti;Joos Heintz;Juan Sabia

  • Deformation techniques for efficient polynomial equation solving

    Joos Heintz;Joos Heintz;Teresa Krick;Susana Puddu;Juan Sabia

  • On the intrinsic complexity of elimination theory

    Joos Heintz;Jacques Morgenstern

  • On the geometry of polar varieties

    Bernd Bank;Marc Giusti;Joos Heintz;Mohab Safey El Din

  • The Hardness of Polynomial Equation Solving

    D. Castro;M. Giusti;J. Heintz;G. Matera

  • Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables

    Joos Heintz;Malte Sieveking

  • Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case

    Unknown

  • Description of the connected components of a semialgebraic set in single exponential time

    Joos Heintz;Marie-Francoise Roy;Pablo Solernó

  • On the Time–Space Complexity of Geometric Elimination Procedures

    Joos Heintz;Guillermo Matera;Ariel Waissbein

  • Lower Bounds for diophantine Approximation

    M. Giusti;J. Heintz;K. Hägele;J. E. Morais

  • Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields.

    Joos Heintz

Frequent Co-Authors

Marie-Françoise Roy
Marie-Françoise Roy University of Rennes
Nicolas Bruno
Nicolas Bruno Microsoft (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to a variety of connected fields, including business and data analysis. For those interested in blending mathematical skills with management, exploring 12 month MBA programs offers an accelerated path to leadership roles.

Many students consider transferring credits to shorten their study time. If you're looking to continue your education seamlessly, check out MBA programs that accept transfer credits, which can make advancing your career more flexible and affordable.

For those focused on data-driven decision-making, an increasing number of data analysis programs are available online. These programs leverage mathematical concepts heavily, providing valuable skills for industries such as finance, healthcare, and technology.

If you’re prioritizing ease of admission along with a quality education, exploring easy MBA programs to get into can be a practical step. These paths can help bridge the gap between mathematics and business without overwhelming admission barriers.

Best Scientists Citing Joos Heintz

Recently Published Articles