Re: triple algorithms

Ertugrul Söylemez <es@xxxxxxxx> writes:
That's what I was saying. We know that factorization can be done in
polynomial time. We just don't have the computer to do it.

Factorization can also be done in constant time, by that criterion.

With the difference that we don't know a realistic algorithm, and that
there isn't any evidence that it _may_ be possible.

Ok, if you replace "can be done" with "might be doable" then your
second sentence quoted is correct.
.

Relevant Pages

  • Re: triple algorithms
    ... Factorization can also be done in constant time, ... that there isn't any evidence that it _may_ be possible. ... the possibility of a practically runnable polynomial time factoring ... even constant time algorithms are possible. ...
    (sci.crypt)
  • Re: Rules FAQ
    ... to talk about "polynomial time" because, technically speaking, it can ... be solved in constant time. ... Prev by Date: ...
    (rec.games.go)
  • Re: triple algorithms
    ... polynomial time. ... Factorization can also be done in constant time, by that criterion. ... there isn't any evidence that it _may_ be possible. ...
    (sci.crypt)
  • Re: triple algorithms
    ... polynomial time. ... Factorization can also be done in constant time, by that criterion. ...
    (sci.crypt)
  • Re: JSH: Easy math, easy solution
    ... >website and do their prime factorization challenge. ... All of these steps can be performed in polynomial time on a classical ... time using both a quantum computer and a classical computer. ...
    (sci.math)