Registro:

Referencias:

• Bank, B., Giusti, M., Heintz, J., Lecerf, G., Matera, G., Solernó, P., Degeneracy loci and polynomial equation solving (2013) Found. Comput. Math., , arxiv:arXiv1306.3390, in press. Eprint [math.AG]
• 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, 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 (2010) Appl. Algebra Eng. Commun. Comput., 21, pp. 33-83
• Basu, S., Pollack, R., Roy, M.-F., On the combinatorial and algebraic complexity of quantifier elimination (1996) J. ACM, 43, pp. 1002-1045
• Basu, S., Pollack, R., Roy, M.-F., Algorithms in Real Algebraic Geometry (2006) Algorithms and Computation in Mathematics, 10. , second ed. (English) Springer Berlin
• Bucero, M.A., Mourrain, B., (2013) Certified Relaxation for Polynomial Optimization on Semi-algebraic Sets, , arxiv:1307.6426 Eprint
• Bürgisser, P., Clausen, M., Shokrollahi, M.A., (1997) Algebraic Complexity Theory, with the Collaboration of Thomas Lickteig, 315. , Grundlehren der Mathematischen Wissenschaften Springer-Verlag Berlin etc
• Cafure, A., Matera, G., Fast computation of a rational point of a variety over a finite field (2006) Math. Comp., 75, pp. 2049-2085
• Canny, J.F., Some algebraic and geometric computations in PSPACE (1988) ACM Symposium on Theory of Computing, STOC, pp. 460-467
• Coste, M., Roy, M.-F., Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets (1988) J. Symbolic. Comput., 5, pp. 121-129
• Cucker, F., Laneau, H., Mishra, B., Pedersen, P., Roy, M.-F., NC algorithms for real algebraic numbers (1992) Appl. Algebra Eng. Commun. Comput., 3 (2), pp. 79-98
• Demazure, M., (1989) Catastrophes et Bifurcations, , Ellipses Paris
• Demmel, J., Nie, J., Powers, V., Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (2007) J. Pure Appl. Algebra, 209, pp. 189-200
• Durvye, C., Lecerf, G., A concise proof of the Kronecker polynomial system solver from scratch (2008) Expo. Math., 26, pp. 101-139
• Fulton, W., (1998) Intersection Theory, 2 FOLGE. , second ed. (English) Ergebnisse der Mathematik und ihrer Grenzgebiete 3 Springer Berlin xiii
• Giusti, M., Heintz, J., Hägele, K., Morais, J.E., Montaña, J.L., Pardo, L.M., 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, pp. 101-146
• Giusti, M., Lecerf, G., Salvy, B., A Gröbner free alternative for polynomial system solving (2001) J. Complexity, 17, pp. 154-211
• Greuet, A., (2013) Optimisation Globale Algébrique et Variétés: Théorie, Algorithmes et Implantations, , Ph.D. Thesis, Université Versailles Saint-Quentin
• Greuet, A., Guo, F., Safey El Din, M., Zhi, L., Global optimization of polynomials restricted to a smooth variety using sums of squares (2012) J. Symbolic. Comput., 47, pp. 883-901
• Greuet, A., Safey El Din, M., Deciding reachability of the infimum of a multivariate polynomial (2011) ISSAC 2011 Proceedings, , San Jose
• Greuet, A., Safey El Din, M., (2013) Probabilistic Algorithm for Polynomial Optimization over A Real Algebraic Set, , arxiv:1307.8281 Eprint
• Grigor'Ev, D., Vorobjov, N., Solving systems of polynomial inequalities in subexponential time (1988) J. Symbolic. Comput., 5, pp. 37-64
• Hà, H.V., Pham, T.S., Solving polynomial optimization problems via the truncated tangency variety and sums of squares (2009) J. Pure Appl. Algebra, 213 (11), pp. 2167-2176
• Heintz, J., Definability and fast quantifier elimination in algebraically closed fields (1983) Theoret. Comput. Sci., 24, pp. 239-277
• Heintz, J., Matera, G., Waissbein, A., On the time-space complexity of geometric elimination procedures (2001) Appl. Algebra Eng. Commun. Comput., 11, pp. 239-296
• Heintz, J., Roy, M.-F., Solernó, P., On the complexity of semialgebraic sets (1989) IFIP Information Processing, Vol. 89, pp. 293-298. , G.X. Ritter, Elsevier
• Jeronimo, G., Perrucci, D., (2013) A Probabilistic Symbolic Algorithm to Find the Minimum of A Polynomial Function on A Basic Closed Semialgebraic Set, , arxiv:1304.5558 Eprint
• Jeronimo, G., Perrucci, D., Tsigaridas, E., On the minimum of a polynomial function on a basic closed semialgebraic set and applications (2011) SIAM J. Optim., , in press
• Lasserre, J.B., Global optimization with polynomials and the problem of moments (2001) SIAM J. Optim., 11 (3), pp. 796-817
• Le Guernic, C., Safey El Din, M., On the practical computation of one point in each connected component of a semi-algebraic set defined by a polynomial system of equations and non-strict inequalities (2004) Proceedings of EACA, , INRIA Rapport de Recherche 5079 L. Gonzalez-Vega (Ed.) Santander, Spain
• Matsumura, H., (1989) Commutative Ring Theory, 8. , Paperback Cambridge Studies in Advanced Mathematics Cambridge University Press Cambridge etc. Transl. from the Japanese by M. Reid
• Mumford, D., (1988) The Red Book of Varieties and Schemes, 1358. , Lecture Notes in Mathematics Springer-Verlag Berlin etc
• Nie, J., An exact Jacobian SDP relaxation for polynomial optimization (2013) Math. Program., 137 (1-2 A), pp. 225-255
• Pedersen, P., Roy, M.-F., Szpirglas, A., Counting real zeroes in the multivariate case (1993) Computational Algebraic Geometry, 109, pp. 203-224. , Frédéric Eyssette, Papers from a conference, held in Nice, France, April 21-25, 1992 Prog. Math. Birkhäuser Boston
• 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, pp. 255-352
• Roy, M.-F., Szpirglas, A., Complexity of the computations with real algebraic numbers (1990) J. Symbolic. Comput., 10, pp. 39-51
• Safey El Din, M., Computing the global optimum of a multivariate polynomial over the reals (2008) ISSAC 2008 Proceedings, , D. Jeffrey (Ed.) Austria, Hagenberg
• Safey El Din, M., Practical and theoretical issues for the computation of generalized critical values of a polynomial mapping (2008) ASCM 2007, 5081. , D. Kapur, Lecture Notes in Computer Science Springer Berlin
• Safey El Din, M., Schost, E., Polar varieties and computation of one point in each connected component of a smooth real algebraic set (2003) Proc. ISSAC 2003, pp. 224-231. , J.R. Sendra, ACM Press
• Shafarevich, I.R., (1994) Basic Algebraic Geometry. 1: Varieties in Projective Space, , Springer-Verlag Berlin
• Vogel, W., (1984) Lectures on Results on Bézout's Theorem, 74. , Notes by D.P. Patil Lectures on Mathematics and Physics, Mathematics Tata Institute of Fundamental Research, Springer Verlag Berlin etc

Citas:

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

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

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

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