THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
DOI10.1070/IM1987v029n02ABEH000979zbMath0631.03006OpenAlexW1979600155MaRDI QIDQ3767321
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
Polynomials in real and complex fields: factorization (12D05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (3)
This page was built for publication: THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS