Timeline for Fermat for polynomials, as used in the AKS (Agrawal-Kayal-Saxena) algorithm
Current License: CC BY-SA 2.5
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 22, 2010 at 19:59 | vote | accept | Lasse Rempe | ||
Aug 21, 2010 at 15:36 | comment | added | Lasse Rempe | A good point. Indeed, with a fact considered to be classical, one would not necessarily give a reference, and if a proof is given, I would usually preface it with a comment that it is well-known. And indeed, in Agrawal and Biswas's paper, they state "This identity is, in fact, a well known property of finite fields that is used in many places". I am not sure how I missed that. I clearly should have looked more carefully before asking the questions. Many thanks for the comments. | |
Aug 20, 2010 at 17:03 | comment | added | Victor Protsak | "I have not been able to find a reference in the literature on the AKS algorithm (which means that the authors also did not know of a reference)": that is a fallacious argument. There is a certain minimum background assumed in writing mathematical articles. If a result is standard, e.g. if it can be found in most textbooks, it may not be necessary to reference it. If you needed to use the fact that the ring of polynomials has no zero divisors, would you give a reference? If you didn't, would that imply that you didn't know of one? | |
Aug 20, 2010 at 16:29 | history | edited | Franz Lemmermeyer |
retag
|
|
Aug 20, 2010 at 16:28 | answer | added | Franz Lemmermeyer | timeline score: 5 | |
Jul 28, 2010 at 17:03 | answer | added | lhf | timeline score: 5 | |
Jul 28, 2010 at 16:31 | history | asked | Lasse Rempe | CC BY-SA 2.5 |