Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen‐Suslin) pour le Calcul Formel

This publication has 13 references indexed in Scilit:

• Some new effectivity bounds in computational geometry
  Lecture Notes in Computer Science, 1989
• Sharp Effective Nullstellensatz
  Journal of the American Mathematical Society, 1988
• Bounds for the Degrees in the Nullstellensatz
  Annals of Mathematics, 1987
• ESTIMATES FOR THE CHARACTERISTIC FUNCTION OF A PRIME IDEAL
  Mathematics of the USSR-Sbornik, 1985
• Definability and fast quantifier elimination in algebraically closed fields
  Theoretical Computer Science, 1983
• Absolute primality of polynomials is decidable in random polynomial time in the number of variables
  Published by Springer Nature ,1981
• Resolution des systemes d'equations algebriques
  Theoretical Computer Science, 1981
• Testing polynomials which are easy to compute (Extended Abstract)
  Published by Association for Computing Machinery (ACM) ,1980
• Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination
  Bulletin de la Société Mathématiques de France, 1977
• Die Frage der endlich vielen Schritte in der Theorie der Polynomideale
  Mathematische Annalen, 1926