A new upper bound on the complexity of derivative evaluation (Q1845616): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(74)90053-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974830618 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5184360 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives / rank | |||
Normal rank | |||
Latest revision as of 15:06, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound on the complexity of derivative evaluation |
scientific article |
Statements
A new upper bound on the complexity of derivative evaluation (English)
0 references
1973
0 references
