Efficient Evaluation of Large Polynomials
Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its terms, compute a representation that permits a more efficient evaluation. Our algorithm runs in d(nt) [superscript O(1)] bit opera...
| Main Authors: | , , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag,
2014-09-22T17:14:55Z.
|
| Subjects: | |
| Online Access: | Get fulltext |