On the bit complexity of finding points in connected components of a smooth real hypersurface

DOI10.1145/3373207.3404058OpenAlexW3046061437MaRDI QIDQ5145969

Éric Schost, Jesse Elliott, Mark W. Giesbrecht

Publication date: 22 January 2021

Published in: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373207.3404058

zbMATH Keywords

complexityNoether positionreal algebraic geometryweak transversality

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (3)

Faster real root decision algorithm for symmetric polynomials ⋮ Bit complexity for computing one point in each connected component of a smooth real algebraic set ⋮ Solving parametric systems of polynomial equations over the reals through Hermite matrices

This page was built for publication: On the bit complexity of finding points in connected components of a smooth real hypersurface