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

Guardado en:
Detalles Bibliográficos
Publicado: 2000
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_07644442_v331_n6_p485_Jeronimo
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 paper:paper_07644442_v331_n6_p485_Jeronimo
record_format dspace
spelling paper:paper_07644442_v331_n6_p485_Jeronimo2023-06-08T15:45:44Z 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 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. 2000 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_07644442_v331_n6_p485_Jeronimo 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.
title Probabilistic equidimensional decomposition *
spellingShingle 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 *
publishDate 2000
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_07644442_v331_n6_p485_Jeronimo
http://hdl.handle.net/20.500.12110/paper_07644442_v331_n6_p485_Jeronimo
_version_ 1768546353260003328

Ejemplares similares