Software Engineering and complexity in effective Algebraic Geometry

2012/05/05 by Joos Heintz, Bart Kuijpers, Andrés Rojas Paredes · 1 citation
Computer Science · #Formal Methods in Verification #Logic, programming, and type systems #Polynomial and algebraic computation

paper · doi:10.1016/j.jco.2012.04.005

openalex publication_date 2012/05/05 · crossref created 2012/05/05 · crossref issued 2013/02/01 · crossref published 2013/02/01 · crossref published-print 2013/02/01 · crossref deposited 2018/11/23 · openalex created_date 2025/10/10 · crossref indexed 2026/04/02 · openalex updated_date 2026/07/23

Citations

• The intrinsic complexity of parametric elimination methods
• Definability and fast quantifier elimination in algebraically closed fields
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• Straight-line programs in geometric elimination theory
• Algebraic methods for interactive proof systems
• The evaluation of geometric queries: constraint databases and quantifier elimination

Cited by

• Joos Ulrich Heintz [wikipedia]