Time-Space Tradeoffs in Algebraic Complexity Theory
We exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial evaluation procedures given by straight-line programs. From the tradeoff results obtained by this method we deduce lower space bounds for polynomial evaluation procedures running in optimal nonscalar time. Time,...
Guardado en:
| Autor principal: | Matera, Guillermo |
|---|---|
| Publicado: |
2000
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0885064X_v16_n1_p2_Aldaz http://hdl.handle.net/20.500.12110/paper_0885064X_v16_n1_p2_Aldaz |
| Aporte de: |
Ejemplares similares
-
Time-Space Tradeoffs in Algebraic Complexity Theory
por: Aldaz, M., et al.
Publicado: (2000) -
Time-Space Tradeoffs in Algebraic Complexity Theory
por: Aldaz, M., et al.
Publicado: (2000) -
Time-Space Tradeoffs in Algebraic Complexity Theory
por: Aldaz, M., et al. -
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.