Probabilistic equidimensional decomposition *

We present a probabilistic algorithm which computes, from a finite set of polynomials defining an algebraic variety V ⊆ double-struck n, the decomposition of V into equidimensional components. The algorithm allows to obtain, for each equidimensional component of V, a set of n + 1 polynomials of boun...

Descripción completa

Detalles Bibliográficos
Autores principales: Jeronimo, G., Sabia, J.
Formato: JOUR
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_07644442_v331_n6_p485_Jeronimo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id todo:paper_07644442_v331_n6_p485_Jeronimo
record_format dspace
spelling todo:paper_07644442_v331_n6_p485_Jeronimo2023-10-03T15:39:39Z Probabilistic equidimensional decomposition * Jeronimo, G. Sabia, J. We present a probabilistic algorithm which computes, from a finite set of polynomials defining an algebraic variety V ⊆ double-struck n, the decomposition of V into equidimensional components. The algorithm allows to obtain, for each equidimensional component of V, a set of n + 1 polynomials of bounded degrees defining it. Its sequential complexity is lower than the complexities of the known algorithms solving the same task. © 2000 Académie des sciences/Éditions scientifiques et médicales Elsevier SAS. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_07644442_v331_n6_p485_Jeronimo
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
description We present a probabilistic algorithm which computes, from a finite set of polynomials defining an algebraic variety V ⊆ double-struck n, the decomposition of V into equidimensional components. The algorithm allows to obtain, for each equidimensional component of V, a set of n + 1 polynomials of bounded degrees defining it. Its sequential complexity is lower than the complexities of the known algorithms solving the same task. © 2000 Académie des sciences/Éditions scientifiques et médicales Elsevier SAS.
format JOUR
author Jeronimo, G.
Sabia, J.
spellingShingle Jeronimo, G.
Sabia, J.
Probabilistic equidimensional decomposition *
author_facet Jeronimo, G.
Sabia, J.
author_sort Jeronimo, G.
title Probabilistic equidimensional decomposition *
title_short Probabilistic equidimensional decomposition *
title_full Probabilistic equidimensional decomposition *
title_fullStr Probabilistic equidimensional decomposition *
title_full_unstemmed Probabilistic equidimensional decomposition *
title_sort probabilistic equidimensional decomposition *
url http://hdl.handle.net/20.500.12110/paper_07644442_v331_n6_p485_Jeronimo
work_keys_str_mv AT jeronimog probabilisticequidimensionaldecomposition
AT sabiaj probabilisticequidimensionaldecomposition
_version_ 1807317843231899648

Ejemplares similares