Re: Factorisation algorithms
- From: Chip Eastham <hardmath@xxxxxxxxx>
- Date: Tue, 16 Oct 2007 21:16:24 -0000
On Oct 16, 3:56 pm, matt271829-n...@xxxxxxxxxxx wrote:
Has anyone ever proved any theoretical bounds on the efficiency of a
general integer factorisation algorithm? Is it still, as far as anyone
knows, possible that a really spectacular advance might be made in
this field?
Yes, as far as I know, it seems entirely possible that
deterministic algorithms may be found with complexity
comparable to the heuristic/probabilistic behavior of
the current best algorithm, the general number field
sieve.
A survey of results through the 20th century is here:
http://algo.inria.fr/seminars/sem00-01/morain.html
regards, chip
.
- References:
- Factorisation algorithms
- From: matt271829-news
- Factorisation algorithms
- Prev by Date: Group of order p^3 and its represenations
- Next by Date: Re: Implementable Set Theory ... AHA !!!
- Previous by thread: Re: Factorisation algorithms
- Next by thread: Re: Factorisation algorithms
- Index(es):
Relevant Pages
|
