On the intrinsic complexity of point finding in real singular hypersurfaces
In previous work we designed an efficient procedure that finds an algebraic sample point for each connected component of a smooth real complete intersection variety. This procedure exploits geometric properties of generic polar varieties and its complexity is intrinsic with respect to the problem. I...
Guardado en:
| Publicado: |
2009
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v109_n19_p1141_Bank http://hdl.handle.net/20.500.12110/paper_00200190_v109_n19_p1141_Bank |
| Aporte de: |
| id |
paper:paper_00200190_v109_n19_p1141_Bank |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_00200190_v109_n19_p1141_Bank2023-06-08T14:40:20Z On the intrinsic complexity of point finding in real singular hypersurfaces Computational complexity Real polynomial equation solving Singular hypersurface Computational complexity Computer applications Data processing Complete intersection Connected component Geometric properties Hyper-surfaces Hypersurface Real polynomial equation solving Sample point Polynomials In previous work we designed an efficient procedure that finds an algebraic sample point for each connected component of a smooth real complete intersection variety. This procedure exploits geometric properties of generic polar varieties and its complexity is intrinsic with respect to the problem. In the present paper we introduce a natural construction that allows to tackle the case of a non-smooth real hypersurface by means of a reduction to a smooth complete intersection. © 2009 Elsevier B.V. All rights reserved. 2009 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v109_n19_p1141_Bank http://hdl.handle.net/20.500.12110/paper_00200190_v109_n19_p1141_Bank |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Computational complexity Real polynomial equation solving Singular hypersurface Computational complexity Computer applications Data processing Complete intersection Connected component Geometric properties Hyper-surfaces Hypersurface Real polynomial equation solving Sample point Polynomials |
| spellingShingle |
Computational complexity Real polynomial equation solving Singular hypersurface Computational complexity Computer applications Data processing Complete intersection Connected component Geometric properties Hyper-surfaces Hypersurface Real polynomial equation solving Sample point Polynomials On the intrinsic complexity of point finding in real singular hypersurfaces |
| topic_facet |
Computational complexity Real polynomial equation solving Singular hypersurface Computational complexity Computer applications Data processing Complete intersection Connected component Geometric properties Hyper-surfaces Hypersurface Real polynomial equation solving Sample point Polynomials |
| description |
In previous work we designed an efficient procedure that finds an algebraic sample point for each connected component of a smooth real complete intersection variety. This procedure exploits geometric properties of generic polar varieties and its complexity is intrinsic with respect to the problem. In the present paper we introduce a natural construction that allows to tackle the case of a non-smooth real hypersurface by means of a reduction to a smooth complete intersection. © 2009 Elsevier B.V. All rights reserved. |
| title |
On the intrinsic complexity of point finding in real singular hypersurfaces |
| title_short |
On the intrinsic complexity of point finding in real singular hypersurfaces |
| title_full |
On the intrinsic complexity of point finding in real singular hypersurfaces |
| title_fullStr |
On the intrinsic complexity of point finding in real singular hypersurfaces |
| title_full_unstemmed |
On the intrinsic complexity of point finding in real singular hypersurfaces |
| title_sort |
on the intrinsic complexity of point finding in real singular hypersurfaces |
| publishDate |
2009 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v109_n19_p1141_Bank http://hdl.handle.net/20.500.12110/paper_00200190_v109_n19_p1141_Bank |
| _version_ |
1768544623235432448 |