Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields☆
Under an Elsevier user license
open archive
Cited by (0)
- ☆
A preliminary version of this paper (A. Galligo, J. Heintz and J. Morgenstern: Parallelism and fast quantifier elimination over algebraically (and real) closed fields) has been presented at “Fundamentals of Computation Theory” (FCT'87), Kazan, USSR, 1987.
Copyright © 1990 Published by Elsevier B.V.