Rumour has it, this theory (not to mention the code itself!) is very lengthy. It may be a while before I have some info on this baby.

- Choose a number,
`N`, you wish to factor - Factor
`N` - Done. (mod details)

- Theoretical Runtime>
- O( exp(c*ln(n)^1/3 * ln(ln(n))^2/3 ) )
- where c is a constant depending on the flavor of algorithm you use.

- Time Analysis: Not yet available
- Source Code: Not yet available
- Alternate Description

Back to the factoring theory page

Back to the factoring page

Back to my home page

Back to the pslc home page Paul Herman

pherman@frenchfries.net

Last Updated: May 23, 1997