## Approximate complex polynomial evaluation in near constant work per point

Publication
, Journal Article

Reif, JH

Published in: Conference Proceedings of the Annual ACM Symposium on Theory of Computing

January 1, 1997

The polynomial at a large number of m≥n of points on the complex plane given the n complex coefficients of a degree n - 1 complex polynomial is evaluated. This problem is required by many algebraic computations and is considered in most basic algorithm texts. An arithmetic model for computation is assumed, where an arithmetic operation can be executed on each step, and is computed exactly. An approximation algorithm is provided for complex polynomial evaluation that cost near constant amortized work per point.

### Duke Scholars

## Published In

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

## DOI

## ISSN

0734-9025

## Publication Date

January 1, 1997

## Start / End Page

30 / 39

### Citation

APA

Chicago

ICMJE

MLA

NLM

Reif, J. H. (1997). Approximate complex polynomial evaluation in near constant work per point.

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing*, 30–39. https://doi.org/10.1145/258533.258543Reif, J. H. “Approximate complex polynomial evaluation in near constant work per point.”

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing*, January 1, 1997, 30–39. https://doi.org/10.1145/258533.258543.Reif JH. Approximate complex polynomial evaluation in near constant work per point. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1997 Jan 1;30–9.

Reif, J. H. “Approximate complex polynomial evaluation in near constant work per point.”

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing*, Jan. 1997, pp. 30–39.*Scopus*, doi:10.1145/258533.258543.Reif JH. Approximate complex polynomial evaluation in near constant work per point. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 1997 Jan 1;30–39.

## Published In

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

## DOI

## ISSN

0734-9025

## Publication Date

January 1, 1997

## Start / End Page

30 / 39