Some of these references are not directly available yet.
	Please ask the author(s) for them by e-mail.
[BaHeKrMaSo90] B. Bank, J. Heintz, T. Krick, R. Mandel, and P. Solernò. Computability and complexity of polynomial optimization problems. In W. Krabs and J. Zowe, editors, Modern Methods of Optimization, pages 1--23. Springer, 1990.

[FiGa90] Noai Fitchas and A. Galligo. Nullstellensatz effectif et conjecture de Serre (thèoréme de Quillen-Suslin) pour le calcul formel. Math. Nachr., 149:231--253, 1990.

[FiGaMo90a] N. Fitchas, A. Galligo, and J. Morgenstern. Algorithmes rapides en sequentiel et en parallele pour l'èlimination des quantificateurs en Gèomètrie èlementaire. Seminaire sur les structures algebraiques ordonnees, pages 103--145, 1990.

[FiGaMo90b] N. Fitchas, A. Galligo, and J. Morgenstern. Precise sequential and parallel complexity bounds for quantifier elemination over algebraically closed fields. Journal of Pure and Applied Algebra, 67:1--14, 1990.

[HeKrRoSo90] J. Heintz, T. Krick, M.-F. Roy, and P. Solernò. Geometric problems solvable in single exponential time. In AAECC-8, LNCS. Springer, 1990.

[HeRoSo90a] J. Heintz, M.-F. Roy, and P. Solernò. Single exponential path finding in semialgebraic sets: Part I: The case of a regular bounded hypersurface. In AAECC-8, LNCS 508, pages 180--196. Springer, 1990.

[HeRoSo90b] J. Heintz, M.-F. Roy, and P. Solernò. Sur la complexitè du principe de Tarski-Seidenberg. Bull. Soc. Math. de France, 118:101--126, 1990.

Back to TERA Publications page Back to TERA Info page