Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line programs. Its complexity is polynomial in the number of coefficients of the input system and the degree of the resultant com...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2007 |
| País: | Argentina |
| Institución: | Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales |
| Repositorio: | Biblioteca Digital (UBA-FCEN) |
| Idioma: | inglés |
| OAI Identifier: | paperaa:paper_07477171_v42_n1-2_p218_Jeronimo |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_07477171_v42_n1-2_p218_Jeronimo |
| Access Level: | acceso abierto |
| Palabra clave: | Multihomogeneous system Poisson-type product formula Sparse resultant Symbolic Newton's algorithm |
| Sumario: | We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line programs. Its complexity is polynomial in the number of coefficients of the input system and the degree of the resultant computed. © 2006 Elsevier Ltd. All rights reserved. |
|---|