#17920: Reimplement IntegerLists using Polyhedron.integral_points()
-------------------------------------+-------------------------------------
Reporter: jdemeyer | Owner:
Type: enhancement | Status: needs_review
Priority: blocker | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jdemeyer/ticket/17920 | b0a04aa5a4454766ed9802d8e99abcd7fb3e105b
Dependencies: #17937 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
Replying to [comment:39 nthiery]:
> keep the Polyhedron implementation for testing purposes as well as for
counting, ...
I'm not sure about the counting... I guess a well-written Cython
implementation of `IntegerListsLex` will usually be faster than the
current polyhedra code. Profiling shows that a lot of time is spent in
just ''constructing'' the polyhedra (if there are not so many points,
enumerating them takes a lot less time than constructing the polyhedron in
the first place).
--
Ticket URL: <http://trac.sagemath.org/ticket/17920#comment:41>
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.
