20051215, 08:47  #12  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
289A_{16} Posts 
Quote:
Here is a short and incomplete list to get you started.
You will probably find more with the aid of a search engine, which is something I suggested you should use in an earlier post. Here is one which you may find useful: http://www.ams.org/mathscinet/ though, to be fair, the full site is not available to those (like me) do not have a paidfor subscription. Relevance: no, a complete history of factoring would not be relevant to the discovery of a new factoring algorithm. A one or two para introduction would be, but you would cite only one reference and that to a general text such as, perhaps, Riesel. On the other hand, hardly ever is a new algorithm completely new, with no similarities to previously known algorithms. You would refer to the similar ones. Paul Last fiddled with by xilman on 20051215 at 08:49 

20051215, 08:54  #13  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2×5,197 Posts 
Quote:
Does your algorithm always work? Have you proved this? Are there special cases for which it doesn't work? How fast does your algorithm run? By this, I mean how does it scale? Does a problem N times the size take log(N) times as long? N times? N^2 times? 2^N times? Have you proved this? Is your algorithmic probablistic? If so, what is the expected run time? What is the maximum run time? Lots of other things for you to think about. Paul 

20051215, 10:08  #14 
"Nancy"
Aug 2002
Alexandria
100110100011_{2} Posts 
Some things I'd like to read about in a paper:
Does the algorithm borrow ideas from earlier algorithms? If so, which ones? Which parts are new? Why did you do it like that? How does the new algorithm compare to existing ones? Run time, memory requirements? Do the improvements work for all cases, or only special ones? Which problems remain with the new algorithm, i.e. what could be further improved? Are these problems well known open problems that were encountered in related algorithms? And giving a brief overview of existing literature in the introduction section of the paper will show to the reviewer/reader that you did the necessary background reading on the subject which helps you paper being taken seriously. Alex 
20051215, 22:29  #15 
∂^{2}ω=0
Sep 2002
Repรบblica de California
11571_{10} Posts 
I would suggest that before even beginning to write a manuscript, the following should be addressed satisfactorily, in the order given:
1) Correctness  does the algorithm work for all cases? If not, what are the exceptional cases? 2) Novelty  assuming (1) is satisfied, i.e. the algorithm works in all cases or all but a small (and welldefined) subset of exceptional cases, is the algorithm genuinely new? If there is overlap or similarity with known algorithms (which is nearly inevitable), then to what degree? 3) Assuming the algorithm is both correct and sufficiently novel, what is the asymptotic runtime, as a function of both input and penultimatefactor size? This is the same as asking, "is the algorithm useful?" If there is an asymptotic difference between the currentbest implementation and what is achievable using known fastarithmetic algorithms (e.g. fast multiply and mod), indicate both work estimates. Unless the algorithm is correct, sufficiently novel and useful (or likely to be, with a reasonable level of software optimization), I doubt you will have a chance to get it published in any respectable venue. Last fiddled with by ewmayer on 20051215 at 22:31 
20051216, 15:56  #16  
May 2003
3×7×11 Posts 
Quote:


20051216, 17:17  #17  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2·5,197 Posts 
Quote:
Dan is a bright guy, but I really dislike his habit of including a reference to almost every paper from the last halfcentury which may conceivably have any point of contact with his. Paul 

20051217, 00:16  #18  
May 2003
3·7·11 Posts 
Quote:
Personally I just love his historian role. He's always happy to point out that other people really had gaping holes in their background knowledge! In the most blunt of ways. (I'm thinking of the FFT one, for example, where he even slashes at Knuth.) 

20051217, 11:28  #19 
Jun 2005
Near Beetlegeuse
2^{2}×97 Posts 
Being one of the great unwashed who have never heard of D J Bernstein, I did a Google search for him and found his home page where, by one of those strange coincidences that sometimes make life seem more interesting than it really is, he includes some advice on writing good Maths papers. He also includes a number of links to other sources (not all of which are actually published on the web) of similar advice. Given the original purpose of this thread I thought Citrix at least might be interested.
Notes on writing papers: http://cr.yp.to/writing.html The devilโs guide to citing the literature: http://cr.yp.to/bib/devilcite.html 
20051217, 19:44  #20 
Jun 2003
2^{3}·197 Posts 
Thanks numbers, I will try to read the site.
By the way who is D J Bernstein? I have never heard of him? What field of math does he work in? Citrix 
20051218, 08:29  #21  
Jun 2005
Near Beetlegeuse
2^{2}·97 Posts 
Quote:


20051218, 08:45  #22  
"Nancy"
Aug 2002
Alexandria
100110100011_{2} Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Finding a paper  CRGreathouse  Information & Answers  1  20100817 22:32 
LLT for Fermats : need a paper  T.Rex  Math  3  20100106 19:47 
Interpreting a paper: ei and erf  CRGreathouse  Math  2  20090514 15:39 
My Maths paper.  mfgoode  Math  49  20090510 13:45 
I need a Math paper  T.Rex  Math  5  20070410 12:00 