Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields

This publication has 12 references indexed in Scilit:

• On the complexity of computing syzygies
  Journal of Symbolic Computation, 1988
• Bounds for the Degrees in the Nullstellensatz
  Annals of Mathematics, 1987
• THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
  Mathematics of the USSR-Izvestiya, 1987
• On computing the determinant in small parallel time using a small number of processors
  Information Processing Letters, 1984
• Fields of large transcendence degree generated by values of elliptic functions
  Inventiones Mathematicae, 1983
• Definability and fast quantifier elimination in algebraically closed fields
  Theoretical Computer Science, 1983
• The complexity of the word problems for commutative semigroups and polynomial ideals
  Advances in Mathematics, 1982
• An efficient quantifier elimination algorithm for algebraically closed fields of any characteristic
  ACM SIGSAM Bulletin, 1975
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
  Aequationes mathematicae, 1970
• Die Frage der endlich vielen Schritte in der Theorie der Polynomideale
  Mathematische Annalen, 1926