#18987: Parallel computation for TilingSolver.number_of_solutions
-------------------------+-------------------------------------------------
Reporter: | Owner:
slabbe | Status: needs_work
Type: | Milestone: sage-6.9
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers: Vincent Delecroix
combinatorics | Work issues:
Keywords: | Commit:
Authors: | 0d68ecec28cb92d9e78a92d6e733d42b3e8941c1
Sébastien Labbé | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18987 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Replying to [comment:56 slabbe]:
> > Moreover, everything would be faster if you would store integer
vectors instead of tuples (and an attribute `self._free_module`). Why
aren't you doing that?
>
> 1. Because I think I wanted to use the most basic hashable container
(tuple) for the need. I realized only recently that it was slow because
there are many matrix operations and additions involved. So indeed,
storing vectors would be better.
>
> 2. Because it is not the purpose of this ticket.
I opened #19036
--
Ticket URL: <http://trac.sagemath.org/ticket/18987#comment:58>
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.
