Factoring integers on a classical computer
From: Craig Feinstein (cafeinst_at_msn.com)
Date: 03/11/05
- Next message: Lasse: "Re: Factoring integers on a classical computer"
- Previous message: Chris Menzel: "Re: semantic nets vs first-order logic"
- Next in thread: Lasse: "Re: Factoring integers on a classical computer"
- Reply: Lasse: "Re: Factoring integers on a classical computer"
- Reply: Tim Peters: "Re: Factoring integers on a classical computer"
- Reply: Virgil: "Re: Factoring integers on a classical computer"
- Reply: John Bailey: "Re: Factoring integers on a classical computer"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 11 Mar 2005 09:26:52 -0800
Is there any known algorithm which factors integers that has a better
worst-case running-time than the brute force method (of testing all
integers between 1 and sqrt(n) to see if one of them divides n)?
Note: It is known that there are methods out there which are more
practical than brute force, but these methods don't always work so well
and when they do not work so well, they run slower than the brute force
method.
Craig
- Next message: Lasse: "Re: Factoring integers on a classical computer"
- Previous message: Chris Menzel: "Re: semantic nets vs first-order logic"
- Next in thread: Lasse: "Re: Factoring integers on a classical computer"
- Reply: Lasse: "Re: Factoring integers on a classical computer"
- Reply: Tim Peters: "Re: Factoring integers on a classical computer"
- Reply: Virgil: "Re: Factoring integers on a classical computer"
- Reply: John Bailey: "Re: Factoring integers on a classical computer"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|