The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is chara...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Jeronimo, G., Krick, T., Sabia, J., Sombra, M.
Formato: JOUR
Materias:
Chow form
Equidimensional decomposition of algebraic varieties
Overdetermined polynomial equation system
Sparse resultant
Symbolic Newton algorithm
Algorithms
Computational methods
Partial differential equations
Polynomials
Probability
Set theory
Bounded probability algorithm
Computational complexity
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_16153375_v4_n1_p41_Jeronimo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares