Registro:

Referencias:

• Aubry, P., Rouillier, F., El Din, M.S., Real solving for positive dimensional systems (2002) J. Symbolic Computat., 34 (6), pp. 543-560
• Bank, B., Giusti, M., Heintz, J., Pardo, L.M., Generalized polar varieties: Geometry and algorithms (2003) J. Complexity, , Manuscript. Humboldt Universität zu Berlin, Institut für Mathematik. To appear in
• Bank, B., Giusti, M., Heintz, J., Pardo, L.M., A First Approach to Generalized Polar Varieties, , Humboldt Universität zu Berlin, Inst. für Mathematik. Preprint Nr. 2003-5
• Bank, B., Giusti, M., Heintz, J., Mbakop, G.M., Polar varieties and efficient real elimination (2001) Math. Z., 238, pp. 115-144. , Digital Object Identifier (DOI) 10.1007/s002090100248
• Bank, B., Giusti, M., Heintz, J., Mbakop, G.M., Polar varieties, real equation solving and data structures: The hypersurface case (1997) J. Complexity, 13 (1), pp. 5-27
• (1997) Best Paper Award J. Complexity
• Basu, S., Pollack, R., Roy, M.-F., On the combinatorial and algebraic complexity of quantifier elimination (1996) J. Assoc. Comput. Mach., 43 (6), pp. 1002-1045
• Basu, S., Pollack, R., Roy, M.-F., Complexity of computing semi-algebraic descriptions of the connected components of a semialgebraic set (1998) Proc. ISSAC'98, pp. 25-29. , (Rostock, Germany, August 13-15, 1998, O. Gloor, ed.), ACM Press, New York
• Bochnak, J., Coste, M., Roy, M.-F., Géométrie algébrique réelle (1987) Ergebnisse der Mathematik und Ihrer Grenzgebiete, , Springer-Verlag, Berlin-Heidelberg-New York
• Bruns, W., Vetter, U., Determinantal rings (1988) Lecture Notes in Mathematics, 1327. , Springer-Verlag, Berlin
• Bürgisser, P., Clausen, M., Shokrollahi, M.A., Algebraic complexity theory. With the collaboration of Thomas Lickteig (1997) Grundlehren der Mathematischen Wissenschaften, 315. , Springer-Verlag, Berlin
• Canny, J.F., Some algebraic and geometric computations in PSPACE (1988) Proc. 20th ACM Symposium on Theory of Computing, pp. 460-467
• Canny, J.F., Emiris, I.Z., Efficient incremental algorithms for the sparse resultant and the mixed volume (1995) J. Symbolic Comput., 20 (2), pp. 117-149
• Castro, D., Giusti, M., Heintz, J., Matera, G., Pardo, L.M., The hardness of polynomial solving (2003) Found. Comput. Math., 3 (4), pp. 347-420
• Castro, D., Hägele, K., Morais, J.E., Pardo, L.M., Kronecker's and Newton's approaches to solving: A first comparision (2001) J. Complexity, 17 (1), pp. 212-303
• Coste, M., Roy, M.-F., Thom's Lemma, the coding of real algebraic numbers and the computation of the topology of semialgebraic sets (1988) J. Symbolic Comput., 5, pp. 121-130
• Cucker, F., Smale, S., Complexity estimates depending on condition and round-of error (1999) J. Assoc. Comput. Mach., 46 (1), pp. 113-184
• Demazure, M., (1989) Catastrophes et Bifurcations, , Ellipses, Paris
• Eagon, J.A., Northcott, D.G., Ideals defined by matrices and a certain complex associated with them (1962) Proc. Roy. Soc. London Ser. A, 269, pp. 188-204
• Eagon, J.A., Hochster, M., R-sequences and indeterminates (1974) O.J. Math., Oxf. II. Ser., 25, pp. 61-71
• Eisenbud, D., (1995) Commutative Algebra with A View Toward Algebraic Geometry, , Springer-Verlag, New York
• Fulton, W., Intersection theory (1984) Ergebnisse der Mathematik und Ihrer Grenzgebiete, 3. , Springer-Verlag, Berlin
• Von Zur Gathen, J., Parallel linear algebra (1993) Synthesis of Parallel Algorithmus, , (J. Reif, ed.), Morgan Kaufmann, San Francisco, CA
• Giusti, M., Heintz, J., Kronecker's smart, little black boxes (2001) Foundations of Computational Mathematics, pp. 69-104. , (R. A. DeVore, A. Iserles, and E. Süli, eds.), Cambridge Univ. Press, Cambridge
• Giusti, M., Heintz, J., Morais, J.E., Morgenstern, J., Pardo, L.M., Straight-line programs in geometric elimination theory (1998) J. Pure Appl. Algebra, 124 (1-3), pp. 101-146
• Giusti, M., Heintz, J., Hagele, K., Morais, J.E., Montana, J.L., Pardo, L.M., Lower bounds for diophantine approximations (1997) J. Pure and Applied Algebra, 117-118, pp. 277-317
• Giusti, M., Lecerf, G., Salvy, B., A Gröbner free alternative for polynomial system solving (2001) J. Complexity, 17 (1), pp. 154-211
• Grigor'ev, D., Vorobjov, N., Solving systems of polynomial inequalities in subexponential time (1998) J. Symbolic Computat., 5 (1-2), pp. 37-64
• Heintz, J., Fast quantifier elimination over algebraically closed fields (1983) Theoret. Comp. Sci., 24, pp. 239-277
• Heintz, J., Matera, G., Waissbein, A., On the time-space complexity of geometric elimination procedures (2001) Appl. Algebra Engrg. Comm. Comput., 11 (4), pp. 239-296
• Heintz, J., Roy, M.-F., Solernó, P., On the complexity of semialgebraic sets (1989) Proc. Information Processing'89 (IFIP'89), pp. 293-298. , (G. Ritter, ed.), North-Holland, San Francisco
• Heintz, J., Roy, M.-F., Solernó, P., Complexité du principe de Tarski-Seidenberg (1989) CRAS, 309, pp. 825-830. , Série I, Paris
• Heintz, J., Roy, M.-F., Solernó, P., Sur la complexité du principe de Tarski-Seidenberg (1990) Bull. Soc. Math. France, 18, pp. 101-126
• Heintz, J., Schnorr, C.P., Testing polynomials which are easy to compute (1980) Proc. 12th Ann. ACM Symp. on Computing, pp. 262-268
• (1982) Logic and Algorithmic: An Internat. Symposium Held in Honour of Ernst Specker, pp. 237-254. , Monographie No.30 de l'Enseignement de Mathématiques, Genève
• Krick, T., Pardo, L.M., A computational method for diophantine approximation (1996) Proc. MEGA'94, pp. 193-254. , Algorithms in Algebraic Geometry and Applications (L. Gonzales-Vega and T. Recio, eds., Progress in Mathematics 143), Birkhäuser, Basel
• Kunz, E., Kähler differentials (1986) Advanced Lectures in Mathematics, , Vieweg, Braunschweig - Wiesbaden
• Lê, D.T., Teissier, B., Variétés polaires locales et classes de Chern des variétés singulières (1981) Ann. of Mathematics, 114, pp. 457-491
• Lecerf, G., (2001) Une Alternative aux Méthodes de Réécriture pour la Résolution des Systèmes Algébriques, , Thèse. École Polytechnique
• Lecerf, G., Quadratic Newton iterations for systems with multiplicity (2002) Found. Comput. Math., 2 (3), pp. 247-293
• Lehmann, L., Waissbein, A., Wavelets and semi-algebraic sets (2001) Anales JAIIO, 30, pp. 139-155. , WAIT 2001, (M. Frias and J. Heintz, eds.)
• Matera, G., Probabilistic algorithms for geometric elimination (1999) Appl. Algebra Engrg. Commun. Comput., 9 (6), pp. 463-520
• Matsumura, H., Commutative ring theory (1986) Cambridge Studies in Adv. Math., 8. , Cambridge Univ. Press, Cambridge
• Piene, R., Polar classes of singular varieties (1978) Ann. Scient, Éc. Norm. Sup. 4. Série, 11, pp. 247-276
• Renegar, J., A faster PSPACE algorithm for the existential theory of the reals (1988) Proc. 29th Annual IEEE Symposium on the Foundation of Computer Science, pp. 291-295
• Renegar, J., On the computational complexity and geometry of the first order theory of the reals (1992) J. Symbolic Comput., 13 (3), pp. 255-352
• El Din, M.S., (2001) Résolution Réelle des Systèmes Polynomiaux en Dimension Positive, , Thèse. Université Paris VI
• El Din, M.S., Schost, E., Polar varieties and computation of one point in each connected component of a smooth real algebraic set (2003) Proc. 2003 International Symposium on Symbolic and Algebraic Computation (ISSAC 2003), pp. 224-231. , ACM Press
• Spivak, M., (1965) Calculus on Manifolds. A Modern Approach to Classical Theorems of Calculus, , W. A. Benjamin, New York - Amsterdam
• Teissier, B., Variétés Polaires. II. Multiplicités polaires, sections planes et conditions de Whitney (1982) Lecture Notes in Mathematics, 961, pp. 314-491. , Algebraic Geometry (La Rábida, 1981), (J.M. Aroca, R. Buchweitz, M. Giusti and M. Merle, eds.). Springer-Verlag, Berlin
• Vogel, W., (1984) Lectures on Results on Bézout's Theorem, , Springer-Verlag, Berlin
• Lecerf, G., "Kronecker" Software Package, , http://tera.medicis.polytechnique.fr/tera/soft.html, GAGE, École Polytechnique, Paris-Palaiseau

Citas:

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

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

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

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