Re: Factorisation algorithms

Has anyone ever proved any theoretical bounds on the
efficiency of a
general integer factorisation algorithm?

theoretical bounds have been proven for not so efficiently algoritms.

no efficient algoritm is known, let alone a proof of its bound.

it seems to require proof of certain number theory conjectures to decide if that exists, and how it should work.

i have started threads about factoring, feel free to answer them.

they might contain these conjectures...


Is it still,
as far as anyone
knows, possible that a really spectacular advance
might be made in
this field?


depends on those number theoretical conjectures...

nobody proved anything.

unless more factoring tricks in the style of my posts are found , i doubt a spectacular advance is possible.

well , unless you find a proof that there is no efficient algoritm , or that question is undecidable , also spectacular ...

for clarity , that has not been proven either , yet it would not amaze me to see it soon.

factoring is related to many other concepts in math , even non-traditionals like my "deny".

regards
tommy1729
.

Loading