Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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.  show that the trivial cell probe algorithm for the problem is optimal if K is sufficiently large compared to n. As an application,  give a new proof of the fact that P not equal incr-TIME (o(log n/log log n)).
['Peter Bro Miltersen']
I am writing a research paper on a idea On the cell probe complexity of polynomial evaluation
[{"from": "human", "value": "I am writing a research paper on a idea On the cell probe complexity of polynomial evaluation"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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.  show that the trivial cell probe algorithm for the problem is optimal if K is sufficiently large compared to n. As an application,  give a new proof of the fact that P not equal incr-TIME (o(log n/log log n))."}]