#18987: Parallel computation for TilingSolver.number_of_solutions
-------------------------+-------------------------------------------------
Reporter: | Owner:
slabbe | Status: needs_review
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:48 slabbe]:
> > {{{
> > sage: from itertools import product
> > sage: %timeit M = [diagonal_matrix(p) for p in product([1,-1],
repeat=4)]
> > 1 loops, best of 3: 2.9 ms per loop
> > sage: M = [diagonal_matrix(p) for p in product([1,-1], repeat=4)]
> > sage: %timeit S = [m*s.matrix() for m in M for s in SymmetricGroup(4)]
> > 100 loops, best of 3: 18.3 ms per loop
> > }}}
> > So it is likely to be `~20ms`.
>
> Note that you can't use timeit above since there is caching involved in
!SymmetricGroup.
Where?! Beyond the construction of the group (`SymmetricGroup(4) is
SymmetricGroup(4)` gives `True`) nothing is cached.
--
Ticket URL: <http://trac.sagemath.org/ticket/18987#comment:49>
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.
