On 11/5/2014 8:24 AM, William Stein wrote:
* By "we write up" above, I mean you write up something very, very
rough, post it here, and get feedback.
Done!
http://people.uwec.edu/whitchua/notes/sagebugprocess.pdf
I stuck with Ticket 14032 as my example; I think the tradeoff of
interesting algorithm vs. boring bug is OK for a general math audience.
Questions:
* Who found the bug corresponding to ticket 14032? Was the computation
in service of an interesting research question?
* Originally, William said "working modulo a few additional primes".
Does this mean doing p-adic lifting again, or just black-box computing
det A (mod p), as I have implied?
* How fast is the p-adic algorithm? William said it was faster than
Mathematica; does someone have some graphs?
* Is Jeroen Demeyer still a postdoc? Where was Volker at the time of
our story?
--Ursula.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
