A new upper bound on the complexity of derivative evaluation
type: Item
instance of: scholarly article
title: A new upper bound on the complexity of derivative evaluation
zbMATH Open document ID: 0286.68031
DOI: 10.1016/0020-0190(74)90053-2
author: H. T. Kung
published in: Information Processing Letters
publication date: 1973-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65D25
zbMATH DE Number: 3449759
MaRDI profile type: Publication
full work available at URL: 0020-0190(74)90053-2
OpenAlex ID: W1974830618
cites work: Q5184360
cites work: New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
cites work: On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
description: scientific article; zbMATH DE number 3449759