Straight-line programs in geometric elimination theory

1998/02/01 by M. Giusti, M Giusti, Joos Heintz +6 · 4 citations
Computer Science · Mathematics · #Commutative Algebra and Its Applications #Complexity and Algorithms in Graphs #Polynomial and algebraic computation

paper · pdf · doi:10.1016/s0022-4049(96)00099-0

crossref issued 1998/02/01 · crossref published 1998/02/01 · crossref published-print 1998/02/01 · openalex publication_date 1998/02/01 · crossref created 2002/07/25 · crossref deposited 2020/01/08 · openalex created_date 2025/10/10 · crossref indexed 2026/07/10 · openalex updated_date 2026/08/02

Citations

• Definability and fast quantifier elimination in algebraically closed fields
• Factoring polynomials with rational coefficients

Cited by

• Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case
• Degeneracy Loci and Polynomial Equation Solving
• Software Engineering and complexity in effective Algebraic Geometry
• Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case
• Complexity theory and numerical analysis
• Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
• Joos Ulrich Heintz [wikipedia]