#9663: Fast computation of Stirling numbers of 2nd kind
------------------------------------------------+---------------------------
Reporter: fredrik.johansson | Owner: sage-combinat
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.6.1
Component: combinatorics | Keywords:
Author: Fredrik Johansson, Nathann Cohen | Upstream: N/A
Reviewer: Nathann Cohen, Nicolas Borie | Merged:
Work_issues: |
------------------------------------------------+---------------------------
Comment(by jdemeyer):
Replying to [comment:11 ncohen]:
> Replying to [comment:8 jdemeyer]:
> > I think you should add a patch with a test for "unknown algorithm".
>
> What do you mean ?
A test which does something like
{{{
sage: n = stirling_number2(20,11,algorithm='foobar')
}}}
to check the "unknown algorithm" code.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9663#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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
