|
|
Re: New integer multiplication algorithm
Posted:
Mar 3, 2005 8:27 AM
|
|
In article <W3EVd.39424$k4.769750@news1.nokia.com>,
Risto Lankinen <rlankine@hotmail.com> wrote:
>Also, with no financial motive, proving that fast factorization
>is impossible is an equally worthy goal to me, yet way more
>likely as an outcome. [Furthermore, in case of failing in both,
>I think I've already managed to leave enough of margin notes
>in the 'net for the wileses of the future to finish the work :-]
If by "fast" you mean polynomial, then proving that fast factorization
is impossible will prove P!=NP. I believe there are financial rewards
offered for anyone who can prove P?=NP one way or the other.
I personally like your idea. I have always thought that the factoring
problem will be solved by seeing it as the problem of reversing the process
of multiplication. But what do I know? :-)
--
Daniel Jiménez djimenez@cs.utexas.edu
"I've so much music in my head" -- Maurice Ravel, shortly before his death.
" " -- John Cage
|
|
