On sign conditions over real multivariate polynomials

Discrete and Computational Geometry

Volumn 44, Issue 1, 2010, Pages 195-222

  Jeronimo, Gabriela ^a,b   Perrucci, Daniel ^a   Sabia, Juan ^a,b  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b Facultad de Ciencias Naturales e Instituto M Lillo   (Argentina)

Author keywords

Complexity; Consistency problem; Real multivariate polynomials; Sign conditions

Indexed keywords

EID: 77952010731     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-009-9200-4     Document Type: Article

References (44)

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