Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces
For a real square-free multivariate polynomial F, we treat the general problem of finding real solutions of the equation F=0, provided that the real solution set {F=0}ℝ is compact. We allow that the equation F=0 may have singular real solutions. We are going to decide whether this equation has a non...
Guardado en:
| Autores principales: | Bank, B., Giusti, M., Heintz, J., Lehmann, L., Pardo, L.M. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_16153375_v12_n1_p75_Bank |
| Aporte de: |
Ejemplares similares
-
Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces
Publicado: (2012) -
Point searching in real singular complete intersection varieties: Algorithms of intrinsic complexity
por: Bank, B., et al. -
Point searching in real singular complete intersection varieties: Algorithms of intrinsic complexity
Publicado: (2014) -
Bipolar varieties and real solving of a singular polynomial equation
por: Bank, B., et al. -
Intrinsic complexity estimates in polynomial optimization
por: Bank, B., et al.