Complexity of quantifier elimination in the theory of algebraically closed fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 176 LNCS, Issue , 1984, Pages 17-31

  Chistov, A L ^a,b   Grigor’ev, D Yu ^a,b  

^a ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FIRST ORDER THEORIES; QUANTIFIER ELIMINATION; UPPER BOUND;

POLYNOMIALS;

EID: 85036476335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0030287     Document Type: Conference Paper

References (16)

1. Chistov A.L., Grigor'ev D. Yu. Polynomial-time factoring of the multivariable polynomials over a global field, LOMI preprint E-5-82, Leningrad, 1982.
2. Chistov A.L., Grigor'ev D. Yu. Subexponential-time solving systems of algebraic equations. I, LOMI preprint E-9-83, Leningrad, 1983.
3. Chistov A.L., Grigor'ev D. Yu. Subexponential-time solving systems of algebraic equations. II, LOMI preprint E-10-83, Leningrad, 1983.
4. Chistov A.L., Grigor'ev D. Yu. Polynomial-time factoring of polynomials and subexponential-time solving systems and quantifier elimination, Notes of Scientific seminars of LOMI, Leningrad, 1984, vol. 137.
5. Collins G.E. Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Lect. Notes Comput. Sci., 1975, vol.33, p. 134–183.
6. Grigor'ev D. Yu. Multiplicative complexity of a bilinear form over a commutative ring, Lect. Notes Comp. Sci., 1981, vol.118, p.281–286.
7. Heintz J. Definability and fast quantifier elimination in algebraically closed fields, Prepr. Univ. Frankfurt, West Germany, December, 1981.
8. Kaltofen E. A polynomial reduction from multivariate to bivariate integral polynomial factorization, Proc. 14-th ACM Symp. Th. Comput., May, N.Y., 1982, p.261–266.
9. Kaltofen E. A polynomial-time reduction from bivariate to univariate integral polynomial factorization, Proc.23-rd IEEE Symp. Found Comp. Sci., October, N.Y., 1982, p.57–64.
10. Lazard D. Algébre linéaire sur k[X 1,...,X n] et élimination, Bull. Soc. Math. France, 1977, vol.105, p.165–190.
11. Lazard D. Résolutions des systèmes d'équations algébriques, Theor Comput. Sci., 1981, vol.15, p.77–110.
12. Lenstra A.K., Lenstra H.W., Lovasz L. Factoring polynomials with rational coefficients, Math. Ann., 1982, vol.261, p.515–534.
13. Lenstra A.K. Factoring multivariate polynomials over finite fields, Preprint Math. Centrum Amsterdam, IW 221/83, Februari, 1983.
14. Shafarevich I.R. Basic algebraic geometry, Springer-Verlag, 1974.
15. Wüthrich H.R. Ein Entscheidungsverfahren für die Theorie der reellabgeschlossenen Körper, Lect. Notes Comput. Sci., 1976, vol.43, p.138–162.
16. Zariski O., Samuel P. Commutative algebra, vol.1, 2, van Nostrand, 1960.