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...
Guardado en:
| 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: |
| Sumario: | 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. |
|---|