Fast computation of binomial coefficients

DOI10.1007/s11075-020-00912-xzbMath1460.65019OpenAlexW3010749410MaRDI QIDQ2220750

João P. H. Sansão, Leonardo C. Araujo, Adriano S. Vale-Cardoso

Publication date: 25 January 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-020-00912-x

zbMATH Keywords

fast Fourier transformdiscrete Fourier transformbinomial coefficientnumerical analysis

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

Fast computation of multinomial coefficients

Uses Software

• Matlab
• Octave
• WolframAlpha
• SumTools

Cites Work

• Unnamed Item
• Unnamed Item
• Computing Binomial Coefficients

This page was built for publication: Fast computation of binomial coefficients