On the time-space complexity of geometric elimination procedures
In [25] and [22] a new algorithmic concept was introduced for the symbolic solution of a zero dimensional complete intersection polynomial equation system satisfying a certain generic smoothness condition. The main innovative point of this algorithmic concept consists in the introduction of a new ge...
Guardado en:
| Autor principal: | Matera, Guillermo |
|---|---|
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09381279_v11_n4_p239_Heintz http://hdl.handle.net/20.500.12110/paper_09381279_v11_n4_p239_Heintz |
| Aporte de: |
Ejemplares similares
-
On the time-space complexity of geometric elimination procedures
por: Heintz, J., et al. -
Complexity bounds in elimination theory - A survey
Publicado: (1996) -
Complexity bounds in elimination theory - A survey
por: Solernó, P. -
On the complexity of the resolvent representation of some prime differential ideals
por: Jeronimo, Gabriela Tali, et al.
Publicado: (2006) -
On the complexity of the resolvent representation of some prime differential ideals
por: D'Alfonso, L., et al.
Publicado: (2006)