#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 | 6f3164941f2565627afc1128ace01973c788f767
Dependencies: #17937 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dimpase):
Replying to [comment:55 jdemeyer]:
> Replying to [comment:54 nthiery]:
> > By the way: we don't yet use Barvinok-like algorithms for counting
> > (e.g. through LattE), or do we? This could make a difference too.
>
> I just read the first paragraph of the LattE manual and it does
'''exactly''' what we need for counting:
Moreover, counting the points is faster than enumerating the points; there
could be exponentially many points to count, but still the number of them
is only polynomial in the input size, for fixed dimension, and LattE
provides a truly polynomial-time procedure for this counting.
--
Ticket URL: <http://trac.sagemath.org/ticket/17920#comment:66>
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.
