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

DOI10.1145/3373207.3404058MaRDI QIDQ5145969zbMATH OpenOpenAlexWikidataFDO

Authors Jesse Elliott, Éric Schost, Mark 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)

Cited in

(5)

• 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
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
• Faster real root decision algorithm for symmetric polynomials
• On the intrinsic complexity of point finding in real singular hypersurfaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145969)