#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: | cbbc26242b1883f8a51065ccd7e8e97e6154025b
Sébastien Labbé | Stopgaps:
Report Upstream: N/A |
Branch: |
u/slabbe/18987 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Quickly reading [1] (which looks serious but not very deep) it seems that
it is hard to find subinstance of the problems that are well scaled for a
given cluster.
[1] S. M. Ashraful Kadir, "A Parallel Programming Approach to Solve the
Exact Cover Problem"
--
Ticket URL: <http://trac.sagemath.org/ticket/18987#comment:17>
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.
