@article {IOPORT.00985683,
    author       = {Miltersen, Peter Bro},
    title        = {On the cell probe complexity of polynomial evaluation.},
    year         = {1995},
    journal      = {Theoretical Computer Science},
    volume       = {143},
    number       = {1},
    issn         = {0304-3975},
    pages        = {167-174},
    publisher    = {Elsevier Science Publishers, Amsterdam},
    doi          = {10.1016/0304-3975(95)80032-5},
    abstract     = {Summary: 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 $\text{P}\ne\text{incr-TIME}(o(\log n/\log\log n))$.},
    identifier   = {00985683},
}