Registro:

Referencias:

• Bank, B., Giusti, M., Heintz, J., Mbakop, G.M., Polar varieties, real equation solving and data structures: The hypersurface case (1997) J. Complexity, 13, pp. 5-27. , (Best Paper Award J. Complexity 1997)
• Bank, B., Giusti, M., Heintz, J., Mbakop, G.M., Polar varieties and efficient real elimination (2001) Math. Z., 238, pp. 115-144
• Bank, B., Giusti, M., Heintz, J., Pardo, L.M., Generalized polar varieties and an efficient real elimination procedure (2004) Kybernetika (Prague), 40, pp. 519-550
• Bank, B., Giusti, M., Heintz, J., Pardo, L.M., Generalized polar varieties: Geometry and algorithms (2005) J. Complexity, 21, pp. 377-412
• Bank, B., Giusti, M., Heintz, J., Safey El Din, M., Schost, E., On the geometry of polar varieties, AAECC (2009), , http://www.mathematik.hu-berlin.de/publ/pre/2009/P-09-10.pdf, submitted for publication
• Bank, B., Giusti, M., Heintz, J., Pardo, L.M., Variétés bipolaires et résolution d'une équation polynomiale réelle, , http://www.mathematik.hu-berlin.de/publ/pre/2009/P-09-06.pdf, Preprint 09-06, Mathematisches Institut, Humboldt-Universität zu Berlin, 2009
• Basu, S., Pollack, R., Roy, M.-F., (2006) Algorithms in Real Algebraic Geometry. 2nd ed., , Springer-Verlag, Berlin
• Brasselet, J.P., Milnor Classes via Polar Varieties (2000) Contemp. Math., 266. , AMS pp. 181-187
• Canny, J.F., Some algebraic and geometric computations (1988) PSPACE, Proc. 20th ACM Symp. on Theory of Computing, pp. 460-467
• Canny, J.F., The Complexity of Robot Motion Planning (1988) ACM Doctoral Dissertation Awards, 19. , MIT Press, Cambridge, MA
• Castro, D., Giusti, M., Heintz, J., Matera, G., Pardo, L.M., The hardness of polynomial equation solving (2003) Found. Comput. Math., 3, pp. 347-420
• Grigor'ev, D., Vorobjov, N., Solving systems of polynomial inequalities in subexponential time (1988) J. Symbolic Comput., 5, pp. 37-64
• Heintz, J., Kuijpers, B., Constraint databases, data structures and efficient query evaluation (2004) Lecture Notes in Computer Science, 3074, pp. 1-24. , Constraint Databases. First International Symposium, Proceedings. Bart K., et al. (Ed). CDB 2004, Paris, France, June 12-13, 2004, Springer, Berlin
• Heintz, J., Roy, M.F., Solernó, P., On the complexity of semialgebraic sets (1989) IFIP Information Processing, 89, pp. 293-298. , Ritter G.X. (Ed), Elsevier
• Heintz, J., Roy, M.-F., Solernó, P., Single exponential path finding in semialgebraic sets. Part I: The case of a regular bounded hypersurface (1991) Lecture Notes in Comput. Sci., 508, pp. 180-196. , Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proc. of the 8th Intern. Conf. AAECC. Tokyo, 1990. Sakata S. (Ed), Springer
• Piene, R., Polar classes of singular varieties (1978) Ann. Sci. École Norm. Sup. 4. Sér., 11, pp. 247-276
• Renegar, J., A faster PSPACE algorithm for deciding the existential theory of the reals (1988) 29th Ann. Symposium on Foundations of Computer Science, pp. 291-295
• Safey El Din, M., (2005) Finding sampling points on real hypersurfaces is easier in singular situations, , http://www-spiral.lip6.fr/~safey/publi.html, prepublication
• Safey El Din, M., Schost, E., Properness defects of projections and computation of at least one point in each connected component of a real algebraic set (2004) J. Discrete Comput. Geom., 32, pp. 417-430
• Safey El Din, M., Trebuchet, P., Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry, , http://arxiv.org/abs/cs/0610051
• Safey El Din, M., Schost, E., (2009) A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces, , arXiv:0902.1612v1
• Teissier, B., Quelques points de l'histoire des variétés polaires, de Poncelet à nos jours (1988) Sémin. Anal. 1987-1988, 4. , Univ. Blaise Pascal

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------