Complexity of the resolution of parametric systems of polynomial and inequations

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2006, Issue , 2006, Pages 246-253

  Moroz, Guillaume ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Complexity; Discriminant variety; Elimination; Parametric polynomial system

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; PROBLEM SOLVING; TURING MACHINES;

DISCRIMINANT VARIETY; ELIMINATION; PARAMETRIC POLYNOMIAL SYSTEMS; REAL SOLUTIONS;

POLYNOMIALS;

EID: 33748977614     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. ANAI, H., HARA, S., AND YOKOYAMA, K. Sum of roots with positive real parts. In ISSAC'05, pp. 21-28.
2. BASU. New results on quantifier elimination over real closed fields and applications to constraint databases. JACM: Journal of the ACM 46 (1999).
3. BASU, POLLACK, AND ROY. On the combinatorial and algebraic complexity of quantifier elimination. JACM: Journal of the ACM 43 (1996).
4. BECKER, T., AND WEISPFENNING, V. Gröbner bases, vol. 141 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1993.
5. BERNASCONI, A., MAYR, E. W., RAAB, M., AND MNUK, M. Computing the dimension of a polynomial ideal, May 06 2002.
6. BROWN, C. W., AND MCCALLUM, S. On using bi-equational constraints in CAD construction. In ISSAC'05, pp. 76-83.
7. BROWNAWELL, W. D. A pure power product version of the Hubert Nullstellensatz. Michigan Math. J. 45, 3 (1998), 581-597.
8. BUCHBERGER, B. A theoretical basis for the reduction of polynomials to canonical forms. j-SIGSAM 10, 3 (Aug. 1976), 19-29.
9. COLLINS, G. E. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. Springer Verlag, 1975.
10. CORVEZ, S., AND ROUILLIER, F. Using computer algebra tools to classify serial manipulators. In Automated Deduction in Geometry (2002), pp. 31-43.
11. COX, D., LITTLE, J., AND O'SHEA, D. Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer Verlag, 1992.
12. COX, D. A., LITTLE, J. B., AND O'SHEA, D. B. Using algebraic geometry, vol. 185 of Graduate Texts in Mathematics. Springer-Verlag, 1998.
13. FAUGÈRE, J. C. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In ISSAC'02, pp. 75-83.
14. FAUGÈRE, J.-C., AND JOUX, A. Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases. In Advances in cryptology - CRYPTO 2003, vol. 2729 of Lecture Notes in Comput. Sei. Springer, Berlin, 2003, pp. 44-60.
15. FOTIOU, I. A., ROSTALSKI, P., PARRILO, P. A., AND MORARI, M. Parametric optimization and optimal control using algebraic geometry methods. International Journal of Control (to appear).
16. FULTON, W. Intersection theory, second ed., vol. 2. Springer-Verlag, Berlin, 1998.
17. GIUSTI, M. Some effectivity problems in polynomial ideal theory. In EUROSAM 84, vol. 174 of Lecture Notes in Comput. Sci. 1984, pp. 159-171.
18. GIUSTI, M., AND HEINTZ, J. La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial. In Computational algebraic geometry and commutative algebra, vol. 34. 1993, pp. 216-256.
19. GIUSTI, M., AND SCHOST, É. Solving some overdetermined polynomial systems. In ISSAC'99.
20. GRIGORIEV, D., AND VOROBJOV, N. Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. In ISSAC'00, pp. 137-146.
21. HEINTZ, J. Definability and fast quantifier elimination in algebraically closed fields. Theoretical Computer Science 24, 3 (Aug. 1983), 239-277.
22. KRICK, T., AND PARDO, L. M. A computational method for Diophantine approximation. In Algorithms in algebraic geometry and applications, vol. 143 of Progr. Math. 1996, pp. 193-253.
23. n] et élimination. Bull. Soc. Math. France 105 (1977), 165-190.
24. LAZARD, D., AND ROUILLIER, F. Solving parametric polynomial systems. Tech. rep., INRIA, 2004. Accepted for publication in Journal of Symbolic Computation.
25. MATERA, G., AND TURULL TORRES, J. M. The space complexity of elimination theory: upper bounds. In Foundations of computational mathematics. 1997, pp. 267-276.
26. PUDDU, S., AND SABIA, J. An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs. J. Pure Appl. Algebra 129, 2 (1998), 173-200.
27. RABINOWITSCH, J. L. Zum Hilbertschen Nullstellensatz. Math. Ann. 102, 1 (1930), 520.
28. SCHOST, É. Computing parametric geometric resolutions. Appl. Algebra Engrg. Comm. Comput. 13, 5 (2003), 349-393.
29. SOMMESE, A. J., VERSCHELDE, J., AND WAMPLER, C. W. Introduction to numerical algebraic geometry. In Solving polynomial equations, vol. 14 of Algorithms Comput. Math. 2005, pp. 301-335.
30. VERSCHELDE, J. Numerical algebraic geometry and symbolic computation. In ISSAC'04, p. 3.
31. WANG, D. Elimination methods. Springer-Verlag, Vienna, 2001.
32. WEISPFENNING. Comprehensive grobner bases. Journal of Symbolic Computation 14 (1992).
33. YANG, L., AND ZENG, Z. An open problem on metric invariants of tetrahedra. In ISSAC'05, pp. 362-364.