Registro:

Referencias:

• Alonso, M.-E., Becker, E., Roy, M.-F., Wörmann, T., Zeros, multiplicities, and idempotents for zero-dimensional systems (1996) Algorithms in Algebraic Geometry and Applications, 143, pp. 1-15. , Progr. Math, Basel: Birkhäuser
• Aubry, P., Rouillier, F., Safey El Din, M., Real solving for positive dimensional systems (2002) J. Symb. Comput., 34 (6), pp. 543-560
• Bank, B., Giusti, M., Heintz, J., Mbakop, G.M., Polar varieties, real equation solving, and data structures: The hypersurface case (1997) J. Complex., 13 (1), pp. 5-27
• Bank, B., Giusti, M., Heintz, J., Mbakop, G.M., Polar varieties and efficient real elimination (2001) Math. Z., 238 (1), 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 (5), pp. 519-550
• Bank, B., Giusti, M., Heintz, J., Pardo, L.M., Generalized polar varieties: Geometry and algorithms (2005) J. Complex., 21 (4), pp. 377-412
• Basu, S., Pollack, R., Roy, M.-F., On the combinatorial and algebraic complexity of quantifier elimination (1996) J. ACM, 43 (6), pp. 1002-1045
• Basu, S., Pollack, R., Roy, M.-F., A new algorithm to find a point in every cell defined by a family of polynomials (1998) Quantifier Elimination and Cylindrical Algebraic Decomposition, pp. 341-350. , Linz1993Texts Monogr. Symbol. Comput, Vienna: Springer
• Basu, S., Pollack, R., Roy, M.-F., (2003) Algorithms in Real Algebraic Geometry, 10. , Algorithms and Computation in Mathematics, Berlin: Springer
• Baur, W., Strassen, V., The complexity of partial derivatives (1983) Theor. Comput. Sci., 22 (3), pp. 317-330
• Berkowitz, S., On computing the determinant in small parallel time using a small number of processors (1984) Inf. Process. Lett., 18 (3), pp. 147-150
• Bini, D., Pan, V.Y., Polynomial and Matrix Computations (1994) Fundamental Algorithms, 1. , Progress in Theoretical Computer Science, Boston: Birkhäuser
• Bochnak, J., Coste, M., Roy, M.-F., (1998) Real Algebraic Geometry, 36. , Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], Berlin: Springer
• Bürgisser, P., Clausen, M., Shokrollahi, M.A., (1997) Algebraic Complexity Theory, 315. , Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Berlin: Springer
• Canny, J., Improved algorithms for sign determination and existential quantifier elimination (1993) Comput. J., 36 (5), pp. 409-418
• Collins, G.E., Quantifier elimination for real closed fields by cylindrical algebraic decomposition (1975) Automata Theory and Formal Languages, 33, pp. 134-183. , Second GI Conf., Kaiserslautern1975Lecture Notes in Comput. Sci, Berlin: Springer
• Coppersmith, D., Winograd, S., Matrix multiplication via arithmetic progressions (1990) J. Symb. Comput., 9 (3), pp. 251-280
• Giusti, M., Heintz, J., Hägele, K., Morais, J.E., Pardo, L.M., Montaña, J.L., Lower bounds for Diophantine approximations (1997) J. Pure Appl. Algebra, 117-118, pp. 277-317
• 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., Lecerf, G., Salvy, B., A Gröbner free alternative for polynomial system solving (2001) J. Complex., 17 (1), pp. 154-211
• Grigor'ev, D.Y., Vorobjov Jr., N.N., Counting connected components of a semialgebraic set in subexponential time (1992) Comput. Complex., 2 (2), pp. 133-186
• Heintz, J., Definability and fast quantifier elimination in algebraically closed fields (1983) Theor. Comput. Sci., 24 (3), pp. 239-277
• Heintz, J., Schnorr, C.-P., Testing polynomials which are easy to compute (1982) Logic and Algorithmic, 30, pp. 237-254. , Zurich1980Enseign. Math, Geneva: Univ. Genève
• Heintz, J., Jeronimo, G., Sabia, J., Solernó, P., Intersection Theory and Deformation Algorithms: The Multi-Homogeneous Case, , Manuscript
• Heintz, J., Roy, M.-F., Solernó, P., Sur la complexité du principe de Tarski-Seidenberg (1990) Bull. Soc. Math. Fr., 118 (1), pp. 101-126
• Heintz, J., Krick, T., Puddu, S., Sabia, J., Waissbein, A., Deformation techniques for efficient polynomial equation solving (2000) J. Complex., 16 (1), pp. 70-109
• Jeronimo, G., Matera, G., Solernó, P., Waissbein, A., Deformation techniques for sparse systems (2009) Found. Comput. Math., 9 (1), pp. 1-50
• König, J., (1903) Einleitung in Die Allgemeine Theorie Der Algebraischen Größen, , Leipzig: B.G. Teubner
• Kronecker, L., (1882) Grundzüge einer arithmetischen Theorie der algebraischen Grössen, , Festschrift
• Lecerf, G., Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (2003) J. Complex., 19 (4), pp. 564-596
• Pedregal, P., (2004) Introduction to Optimization, 46. , Texts in Applied Mathematics, New York: Springer
• Renegar, J., On the computational complexity and geometry of the first-order theory of the reals. I, II, III (1992) J. Symb. Comput., 13 (3), pp. 255-352
• Rouillier, F., Solving zero-dimensional systems through the rational univariate representation (1999) Appl. Algebra Eng. Commun. Comput., 9 (5), pp. 433-461
• Rouillier, F., Roy, M.-F., Safey El Din, M., Finding at least one point in each connected component of a real algebraic set defined by a single equation (2000) J. Complex., 16 (4), pp. 716-750
• Safey El Din, M., Testing sign conditions on a multivariate polynomial and applications (2007) Math. Comput. Sci., 1 (1), pp. 177-207
• Safey El Din, M., Schost, É., Polar varieties and computation of one point in each connected component of a smooth algebraic set (2003) Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, pp. 224-231. , (electronic), New York: ACM
• Safey El Din, M., Trébuchet, P., (2006) Strong bi-homogeneous Bézout Theorem and its use in Effective Real Algebraic Geometry, , INRIA Research Report RR-6001
• Schost, É., Computing parametric geometric resolutions (2003) Appl. Algebra Eng. Commun. Comput., 13 (5), pp. 349-393
• Seidenberg, A., A new decision method for elementary algebra (1954) Ann. Math. (2), 60, pp. 365-374
• Shafarevich, I.R., (1977) Basic Algebraic Geometry, , study edition, Berlin: Springer
• Tarski, A., (1951) A Decision Method for Elementary Algebra and Geometry, , 2nd edn., Berkeley: University of California Press
• Voisin, C., (2003) Hodge Theory and Complex Algebraic Geometry. II, 77. , Cambridge Studies in Advanced Mathematics, Cambridge: Cambridge University Press
• von Zur Gathen, J., Parallel arithmetic computations: A survey (1986) Mathematical Foundations of Computer Science, 1986, 233, pp. 93-112. , Bratislava1986Lecture Notes in Comput. Sci, Berlin: Springer
• von Zur Gathen, J., Gerhard, J., (1999) Modern Computer Algebra, , New York: Cambridge University Press

Citas:

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

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

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

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