The Space Complexity of Elimination Theory: Upper Bounds

DOI10.1007/978-3-642-60539-0_20zbMath0867.68057OpenAlexW1483607134MaRDI QIDQ4336106

Guillermo Matera, Jose Maria Turull Torres

Publication date: 12 May 1997

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-60539-0_20

zbMATH Keywords

complexity classescomplexity models

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (6)

Descriptive complexity of deterministic polylogarithmic time and space ⋮ On a generalization of Stickelberger's theorem ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs ⋮ The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. ⋮ Properness defects of projection and minimal discriminant variety

This page was built for publication: The Space Complexity of Elimination Theory: Upper Bounds