20070215, 15:32  #1 
(loop (#_fork))
Feb 2006
Cambridge, England
3^{3}×239 Posts 
Wikipedia article on SNFS
I've tried to tidy this up a bit (the original version suggested that SNFS polynomials could be found for arbitrary numbers, which I felt needed correcting), but it still reads as if it's been written by someone profoundly ignorant of the SNFS; can I convince one of the gurus here to have a look and tell me what I've missed out?
I suppose the right answer is to have a single entry for 'number field sieve', and the SNFS article to concentrate on listing classes of number which have SNFS polynomials for nonobvious reasons, but I don't know how to convince wikipedia to do that sort of refactoring. http://en.wikipedia.org/wiki/Special_number_field_sieve 
20070215, 16:01  #2  
Nov 2003
1110100100100_{2} Posts 
Quote:
SNFS applies to *any* numbers that can be represented as a polynomial with small coefficients. It need not be limited to just the forms listed in the article. However, trying to list all possibilties seems too daunting a task. 

20070215, 17:52  #3 
Oct 2006
vomit_frame_pointer
2^{3}·3^{2}·5 Posts 
Even with its flaws, which I'm not qualified to correct, that's one of Wikipedia's better articles. The link to the article on the rational sieve is the best closetolaymanlevel illustration of what is really going on with NFS.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
yoyo@home and wikipedia  Dubslow  Factoring  1  20151206 15:56 
Mersenne Wikipedia edits?  Sutton Shin  mersennewiki  0  20120929 08:10 
Inconsistencies on Wikipedia?  ShiningArcanine  Math  4  20080902 20:41 
Quadratic Sieve in wikipedia.de  ThiloHarich  Factoring  5  20060714 09:51 
promoted to administrator on Wikipedia!  ixfd64  Lounge  3  20050922 05:44 