Complexity bounds in elimination theory - A survey
This paper is devoted to some last algorithmic progress in classical elimination theory from the complexity point of view. These results will be presented as a short survey (without proofs) treating essentially upper and lower bounds problems. The first aim of this paper is to show that the upper bo...
Guardado en:
| Publicado: |
1996
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03784754_v42_n4-6_p429_Solerno http://hdl.handle.net/20.500.12110/paper_03784754_v42_n4-6_p429_Solerno |
| Aporte de: |
Ejemplares similares
-
Complexity bounds in elimination theory - A survey
por: Solernó, P. -
On the time-space complexity of geometric elimination procedures
por: Matera, Guillermo
Publicado: (2001) -
On the time-space complexity of geometric elimination procedures
por: Heintz, J., et al. -
Real roots of univariate polynomials and straight line programs
por: Perrucci, Daniel, et al.
Publicado: (2007) -
Real roots of univariate polynomials and straight line programs
por: Perrucci, D., et al.
Publicado: (2007)