#16866: Radical difference families
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Vincent Delecroix | Work issues:
Report Upstream: N/A | Commit:
Branch: | 58fed55ef22232a32f3beffae76f4121e775c58e
u/vdelecroix/16866 | Stopgaps:
Dependencies: #16863 |
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Replying to [comment:11 ncohen]:
> Hello !
>
> About {{{one_cyclic_tiling}}}: the DLX algorithm is a pure exhaustive
search.
I do not expect it to be the best.
> Theoretically, what should be called there is
`IncidenceStructure.packing` (this is exactly the problem that you want to
solve).
I would agree but the timings I got are not convincing. Please test the
file I attached to the ticket
{{{
sage: timeit("t = test_all1(5,10)")
5 loops, best of 3: 78 ms per loop
sage: timeit("t = test_all1(6,12)")
5 loops, best of 3: 444 ms per loop
}}}
against
{{{
sage: timeit("t = test_all2(5,10)")
5 loops, best of 3: 267 ms per loop
sage: timeit("t = test_all2(6,12)")
5 loops, best of 3: 1.21 s per loop
}}}
The case of one tile on a circle is very symmetric and there might even be
something better. Note also that for my instances the size of the tile is
small compared to the size of the set.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16866#comment:12>
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.
