Definability and fast quantifier elimination in algebraically closed fields

1983/08/01 by Joos Heintz · 6 citations
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Polynomial and algebraic computation

paper · pdf · doi:10.1016/0304-3975(83)90002-6

crossref issued 1983/08/01 · crossref published 1983/08/01 · crossref published-print 1983/08/01 · openalex publication_date 1983/08/01 · crossref created 2002/07/25 · crossref deposited 2019/04/12 · openalex created_date 2025/10/10 · crossref indexed 2026/06/30 · openalex updated_date 2026/08/02

Citations

• Die Frage der endlich vielen Schritte in der Theorie der Polynomideale

Cited by

• Degeneracy Loci and Polynomial Equation Solving
• Some new effectivity bounds in computational geometry
• Straight-line programs in geometric elimination theory
• Software Engineering and complexity in effective Algebraic Geometry
• Hilbert’s Fifth Problem and Related Topics
• Joos Ulrich Heintz [wikipedia]