Re: JSH: Step by step through the factoring algorithm
- From: Tim Smith <reply_in_group@xxxxxxxxxxxxxxxx>
- Date: Wed, 04 Mar 2009 11:47:12 -0800
In article
<1a37f236-611b-464f-8820-f0adfa734274@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
pubkeybreaker <pubkeybreaker@xxxxxxx> wrote:
requests changes. The idea is that at the end of the process we have a
complete explanation of the algorithm with an example.
Inadequate. Any 'complete' analysis must include a
derivation of the time-complexity.
First things first. What we're trying here is to just get a complete
explanation of what the algorithm is--something sufficient so that one
can actually sit down and apply it to actual numbers, or write a program
to do so. Then we can worry about analyzing it.
--
--Tim Smith
.
- References:
- Re: JSH: Step by step through the factoring algorithm
- From: pubkeybreaker
- Re: JSH: Step by step through the factoring algorithm
- Prev by Date: Re: Simple tetration ...
- Next by Date: Re: JSH: Britain's choice
- Previous by thread: Re: JSH: Step by step through the factoring algorithm
- Next by thread: Re: How do we arrive at this no. of possible permutes
- Index(es):
Relevant Pages
|