#15389: An algorithm for enumerating elements of bounded height in number fields
-------------------------------------+-------------------------------------
Reporter: dkrumm | Owner: dkrumm
Type: enhancement | Status: needs_info
Priority: minor | Milestone: sage-6.3
Component: number theory | Resolution:
Keywords: sage-days55 | Merged in:
Authors: David Krumm, John | Reviewers: Ben Hutz
Doyle | Work issues:
Report Upstream: N/A | Commit:
Branch: | cdad564de1a6cd71f2d42d9f6844dd9070368b88
u/jdoyle/ticket/15389 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by vbraun):
* status: positive_review => needs_info
Comment:
Long doctests should still take <= 5s. Is there anything that can't be
tested by enumerating less than thousands of solutions? Every ticket needs
to run the tests, don't slow it down without reason.
--
Ticket URL: <http://trac.sagemath.org/ticket/15389#comment:35>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
