## Dynamic algebraic algorithms

Publication
, Journal Article

Reif, JH; Tate, SR

Published in: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

January 1, 1994

The authors examine the problem of incrementally evaluating algebraic functions. The paper presents both lower bounds and algorithm design techniques for algebraic problems. The first presentation deals with the lower bounds for simply stated algebraic problems: multipoint polynomial evaluation, polynomial reciprocal, and extended polynomial GCD. The second deals with two general purpose techniques for designing incremental algorithms. The first method can produce highly efficient incremental algorithms and the second method gives a slightly slower incremental algorithm for these problems but can be applicable to a wider class of problems than the first method.

### Duke Scholars

## Published In

Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

## Publication Date

January 1, 1994

## Start / End Page

290 / 301

### Citation

APA

Chicago

ICMJE

MLA

NLM

Reif, J. H., & Tate, S. R. (1994). Dynamic algebraic algorithms.

*Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms*, 290–301.Reif, J. H., and S. R. Tate. “Dynamic algebraic algorithms.”

*Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms*, January 1, 1994, 290–301.Reif JH, Tate SR. Dynamic algebraic algorithms. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. 1994 Jan 1;290–301.

Reif, J. H., and S. R. Tate. “Dynamic algebraic algorithms.”

*Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms*, Jan. 1994, pp. 290–301.Reif JH, Tate SR. Dynamic algebraic algorithms. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. 1994 Jan 1;290–301.

## Published In

Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

## Publication Date

January 1, 1994

## Start / End Page

290 / 301