Time-space tradeoffs for polynomial evaluation
We develop a new method for showing lower bounds for the time-space tradeoff of polynomial evaluation procedures given by straight-line programs. By means of this method we prove an asymptotically sharp lower bound for the time-space tradeoff of general procedures of polynomial evaluation and exhibi...
Guardado en:
Autores principales: | Aldaz, M., Heintz, J., Matera, G., Montaña, J.L., Pardo, L.M. |
---|---|
Formato: | JOUR |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_07644442_v327_n10_p907_Aldaz |
Aporte de: |
Ejemplares similares
-
Time-space tradeoffs for polynomial evaluation
Publicado: (1998) -
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. -
Time-Space Tradeoffs in Algebraic Complexity Theory
por: Aldaz, M., et al.
Publicado: (2000) -
Combinatorial hardness proofs for polynomial evaluation
por: Aldaz, M., et al.