Sparse resultants and straight-line programs
We prove that the sparse resultant, redefined by D'Andrea and Sombra and by Esterov as a power of the classical sparse resultant, can be evaluated in a number of steps which is polynomial in its degree, its number of variables and the size of the exponents of the monomials in the Laurent polyno...
Guardado en:
| Autores principales: | , |
|---|---|
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_07477171_v87_n_p14_Jeronimo http://hdl.handle.net/20.500.12110/paper_07477171_v87_n_p14_Jeronimo |
| Aporte de: |
| Sumario: | We prove that the sparse resultant, redefined by D'Andrea and Sombra and by Esterov as a power of the classical sparse resultant, can be evaluated in a number of steps which is polynomial in its degree, its number of variables and the size of the exponents of the monomials in the Laurent polynomials involved in its definition. Moreover, we design a probabilistic algorithm of this order of complexity to compute a straight-line program that evaluates it within this number of steps. © 2017 Elsevier Ltd |
|---|