Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A new randomized algorithm is presented for computing the characteristic polynomial of an  n  x  n  matrix over a field. Over a suffciently large field the asymptotic expected complexity of the algorithm is  O ( n  θ )field operations, improving by a factor of log  n  on the worst case complexity of Keller-Gehrig's algorithm [11].
['Clément Pernet', 'Arne Storjohann']
I am writing a research paper on a idea Faster algorithms for the characteristic polynomial
[{"from": "human", "value": "I am writing a research paper on a idea Faster algorithms for the characteristic polynomial"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A new randomized algorithm is presented for computing the characteristic polynomial of an  n  x  n  matrix over a field. Over a suffciently large field the asymptotic expected complexity of the algorithm is  O ( n  \u03b8 )field operations, improving by a factor of log  n  on the worst case complexity of Keller-Gehrig's algorithm [11]."}]