Single exponential path finding in semialgebraic sets part I: The case of a regular bounded hypersurface
Let V be a bounded semialgebraic hypersurface defined by a regular polynomial equation and let x1, x2 be two points of V. Assume that x1, x2 are given by a boolean combination of polynomial inequalities. We describe an algorithm which decides in single exponential sequential time and polynomial para...
| Autores principales: | Heintz, J., Roy, M.-F., Solero, P., Sakata S. |
|---|---|
| Formato: | SER |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03029743_v508LNCS_n_p180_Heintz |
| Aporte de: |
Ejemplares similares
-
Single exponential path finding in semialgebraic sets part I: The case of a regular bounded hypersurface
Publicado: (1991) -
On the minimum of a polynomial function on a basic closed semialgebraic set and applications
por: Jeronimo, Gabriela Tali, et al.
Publicado: (2013) -
On the minimum of a polynomial function on a basic closed semialgebraic set and applications
por: Jeronimo, G., et al. -
On the intrinsic complexity of point finding in real singular hypersurfaces
por: Bank, B., et al. -
On the intrinsic complexity of point finding in real singular hypersurfaces
Publicado: (2009)