Critical Point Computations on Smooth Varieties

DOI10.1145/2930889.2930929zbMath1362.14061arXiv1605.02518OpenAlexW2364754288MaRDI QIDQ2985826

Pierre-Jean Spaenlehauer, Mohab Safey El Din

Publication date: 10 May 2017

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

Full work available at URL: https://arxiv.org/abs/1605.02518

zbMATH Keywords

complexitycritical pointsreal geometry

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (8)

Faster real root decision algorithm for symmetric polynomials ⋮ Early Ending in Homotopy Path-Tracking for Real Roots ⋮ A hybrid procedure for finding real points on a real algebraic set ⋮ Solving determinantal systems using homotopy techniques ⋮ Homotopy techniques for solving sparse column support determinantal polynomial systems ⋮ The Bottleneck Degree of Algebraic Varieties ⋮ Bit complexity for computing one point in each connected component of a smooth real algebraic set ⋮ Smooth points on semi-algebraic sets

This page was built for publication: Critical Point Computations on Smooth Varieties