HORNERS RULE IS UNIQUELY OPTIMAL-Reference-Cited by-同舟云学术

HORNERS RULE IS UNIQUELY OPTIMAL

Published:1971 Issue: Volume: Page:45-58
ISSN:
Container-title:Theory of Machines and Computations
language:
Short-container-title:

Author:

Borodin Allan

Publisher

Elsevier

Reference9 articles.

1. “Some Problems in the Computation of Polynomials”;Beiaga;Dokl. Akad. Nauk. SSSR,1958

2. Garsia, A.M. reffered to in Knuth, The Art of Computer Programming – Vol. 2, see prob. 38 in 4.6.4.

3. Linear Algebra;Greub,1963

4. Hopcroft, J. and L. Kerr, “On Minimizing the Number of Multiplications Necessary for Matrix Multiplications”, IEEE Conf. Record of the 10th Annual Symposium of Switching and Automata Theory, (1969).

5. “Evaluation of Polynomials and Evaluations of Rational Functions”;Motzkin;Bull. Amer. Math. Soc.,1955

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. BERTE: High-precision hierarchical classification of transposable elements by a transfer learning method with BERT pre-trained model and convolutional neural network;2024-01-31

2. Even Order Explicit Symplectic Geometric Algorithms for Solving Quaternions in Guidance Navigation and Control via Diagonal Padé Approximation and Cayley Transform;IEEE Access;2024

3. Accelerating Monte Carlo neutron transport by approximating thermal cross sections with functional forms;Annals of Nuclear Energy;2022-05

4. Comparison of Bit and Word Level Algorithms for Evaluating Unstructured Functions over Finite Rings;Cryptographic Hardware and Embedded Systems – CHES 2005;2005

5. A Survey of Parallel Algorithms in Numerical Linear Algebra;SIAM Review;1978-10