I'd be very interested to hear any comments you may have on the efficiency
of the method.
On Sunday, June 24, 2012 1:17:40 PM UTC-4, John Cremona wrote:
>
> Excellent idea -- I would make a lot of us of this, especially if it
> were done very efficiently!
>
> I'll be interested to read your preprint (which I have not yet).
>
> John Cremona
> CC-ing sage-nt
>
> On 24 June 2012 11:21, dkrumm wrote:
> > I would like to know what people think of the idea of implementing a
> method
> > for computing all numbers of bounded height in a given number field. The
> > algorithm is described in the paper http://arxiv.org/pdf/.4963.pdf .
>
> > Since uploading this paper to the arxiv I have had several requests for
> my
> > code, so I thought it might be useful to include it in Sage.
> >
> > --
> > To post to this group, send an email to sage-devel@googlegroups.com
> > To unsubscribe from this group, send an email to
> > sage-devel+unsubscr...@googlegroups.com
> > For more options, visit this group at
> > http://groups.google.com/group/sage-devel
> > URL: http://www.sagemath.org
>
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org