#16499: Cheap speedup in the OA recursive constructions
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Nathann Cohen | Work issues:
Report Upstream: N/A | Commit:
Branch: u/ncohen/16499 | ee77d8e216b43560d0f22263cd4822ec7c5d5d91
Dependencies: #16347 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Hi Nathann,
I propose to
- move this over #16423
- remove the `# long time` for the `MOLS_table` test
- change 15 to 20 or 30 in the `MOLS_table`
Timings are now
{{{
sage: from sage.combinat.designs.latin_squares import MOLS_table
sage: from time import time
sage: t0 = time(); MOLS_table(30); t1 = time()
...
sage: print t1 - t0
3.6996819973
}}}
Impressive!
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16499#comment:9>
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.
