Show simple item record

dc.contributor.authorIerardi, Doug J.en_US
dc.date.accessioned2007-04-23T17:35:11Z
dc.date.available2007-04-23T17:35:11Z
dc.date.issued1988-11en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-948en_US
dc.identifier.urihttps://hdl.handle.net/1813/6788
dc.description.abstractWe consider the problem of deciding whether a set of multivariate polynomials with coefficients in any field $F$ have a common algebraic solution. In this paper we develop a fast parallel algorithm for solving this decision problem. Since the proposed algorithm is algebraic, it easily yields a procedure for quantifier elimination in the theory of an arbitrary algebraically closed field. More precisely, we show how to decide whether $m$ polynomials in $n$ variables, each of degree at most $d$, with coefficients in an arbitrary field $F$ have a common zero in the algebraic closure of $F$, using sequential time $m^{n + O(1)} d^{n^{2} + O(n)}$, or parallel time $O(n^{3} \log^{3} d \log m)$ with $m^{n + O(1)} d^{n^{2} + O(n)}$ processors, in the operations of the coefficient field $F$. Using randomization, this may be improved to $m^{O(1)} d^{O(n)}$ time. In addition, the construction is used give a direct EXSPACE algorithm for quantifier elimination in the theory of an algebraically-closed field, which runs in PSPACE or parallel polynomial time when restricted to formulas with a fixed number of alternations of quantifiers.en_US
dc.format.extent2411224 bytes
dc.format.extent519346 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleQuantifier Elimination in the First-Order Theory of Algebraically Closed Fieldsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics