Definability and fast quantifier elimination in algebraically closed fields
- 1 August 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 24 (3), 239-277
- https://doi.org/10.1016/0304-3975(83)90002-6
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Super-Exponential Complexity of Presburger ArithmeticPublished by Springer Nature ,1998
- Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic DecompositionPublished by Springer Nature ,1998
- The complexity of partial derivativesTheoretical Computer Science, 1983
- An Extension of Strassen’s Degree BoundSIAM Journal on Computing, 1981
- Lower bounds for polynomials with algebraic coefficientsTheoretical Computer Science, 1980
- An efficient quantifier elimination algorithm for algebraically closed fields of any characteristicACM SIGSAM Bulletin, 1975
- Constructions in AlgebraTransactions of the American Mathematical Society, 1974
- Constructions in algebraTransactions of the American Mathematical Society, 1974
- Sylvester’s identity and multistep integer-preserving Gaussian eliminationMathematics of Computation, 1968
- Die Frage der endlich vielen Schritte in der Theorie der PolynomidealeMathematische Annalen, 1926