#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 ncohen):
Hello,
> 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.
True. This being said, your polyhedron code may very well be 'all we can
do' to implement this feature while handling all possible combinations of
parameters.
> Profiling shows that a lot of time is spent in just ''constructing'' the
polyhedra
True. Do you have any idea where that comes from ? I had similar troubles
with the Poset constructor (related to memory usage).
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17920#comment:42>
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.
