Elimination for Generic Sparse Polynomial Systems
We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an ℓ-dimensional coordinate affine space with ℓ<n. The complexity of the algorithm dep...
Guardado en:
| Autores principales: | , , |
|---|---|
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01795376_v_n_p1_Herrero http://hdl.handle.net/20.500.12110/paper_01795376_v_n_p1_Herrero |
| Aporte de: |
| Sumario: | We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an ℓ-dimensional coordinate affine space with ℓ<n. The complexity of the algorithm depends polynomially on some combinatorial invariants associated to the supports. © 2014 Springer Science+Business Media New York. |
|---|