THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
DOI10.1070/IM1987V029N02ABEH000979zbMATH Open0631.03006OpenAlexW1979600155MaRDI QIDQ3767321FDOQ3767321
Publication date: 1987
Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/im1987v029n02abeh000979
polynomial complexityalgorithm for quantifier eliminationfirst order theory of algebraically closed fields
Decidability of theories and sets of sentences (03B25) Polynomials in real and complex fields: factorization (12D05) Complexity of computation (including implicit computational complexity) (03D15) Quantifier elimination, model completeness, and related topics (03C10)
Cited In (4)
- Title not available (Why is that?)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
This page was built for publication: THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767321)
