On the cell probe complexity of polynomial evaluation
Miltersen, P.B. (1994) On the cell probe complexity of polynomial evaluation. Technical Report. Department of Computer Science, Coventry, UK.
![[img]](http://eprints.dcs.warwick.ac.uk/style/images/fileicons/application_pdf.png)
| PDF - Published Version Download (522Kb) | Preview |
Abstract
We consider the cell probe complexity of the polynomial evaluation problem with preprocessing of coefficients, for polynomials of degree at most n over a finite field K. We show that the trivial cell probe algorithm for the problem is optimal if K is sufficiently large compared to n. As an application, we give a new proof of the fact that P != ncr - TIME (o (log n/ log log n) ).
| Item Type: | Monograph (Technical Report) |
|---|---|
| Additional Information: | P.B. Miltersen, “On the Cell Probe Complexity of Polynomial Evaluation”, <i>Theoretical Computer Science</i> <b>143</b>(1), pp. 167-174 (1995) |
| Uncontrolled Keywords: | technicalreport |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Science > Computer Science |
| Depositing User: | Mr Ebrahim Ardeshir |
| Date Deposited: | 17 Dec 2011 23:58 |
| Last Modified: | 01 Nov 2012 18:06 |
| URI: | http://eprints.dcs.warwick.ac.uk/id/eprint/1381 |
Actions (login required)
| View Item |
