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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bank, B., Giusti, M., Heintz, J., Pardo, L.M.
Formato: JOUR
Materias:
Computational complexity
Real polynomial equation solving
Singular hypersurface
Computer applications
Data processing
Complete intersection
Connected component
Geometric properties
Hyper-surfaces
Hypersurface
Sample point
Polynomials
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_00200190_v109_n19_p1141_Bank
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id todo:paper_00200190_v109_n19_p1141_Bank
record_format dspace
spelling todo:paper_00200190_v109_n19_p1141_Bank2023-10-03T14:16:38Z On the intrinsic complexity of point finding in real singular hypersurfaces Bank, B. Giusti, M. Heintz, J. Pardo, L.M. 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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
Bank, B.
Giusti, M.
Heintz, J.
Pardo, L.M.
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.
format JOUR
author Bank, B.
Giusti, M.
Heintz, J.
Pardo, L.M.
author_facet Bank, B.
Giusti, M.
Heintz, J.
Pardo, L.M.
author_sort Bank, B.
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
url http://hdl.handle.net/20.500.12110/paper_00200190_v109_n19_p1141_Bank
work_keys_str_mv AT bankb ontheintrinsiccomplexityofpointfindinginrealsingularhypersurfaces
AT giustim ontheintrinsiccomplexityofpointfindinginrealsingularhypersurfaces
AT heintzj ontheintrinsiccomplexityofpointfindinginrealsingularhypersurfaces
AT pardolm ontheintrinsiccomplexityofpointfindinginrealsingularhypersurfaces
_version_ 1782028322346106880

Ejemplares similares