Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Caching binomials #20

Open
mforets opened this issue Feb 25, 2020 · 0 comments
Open

Caching binomials #20

mforets opened this issue Feb 25, 2020 · 0 comments

Comments

@mforets
Copy link
Member

mforets commented Feb 25, 2020

Consider using a lookup table for the binomial coefficients up to some order. In addition, the function
f(i, j, k, m) = binomial(m, i-j) * binomial(k, j) / binomial(k+m, i) is used in univariate / multivariate computations.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@mforets