Fast computation of multinomial coefficients
type: Item
instance of: scholarly article
title: Fast computation of multinomial coefficients
zbMATH Open document ID: 1485.65018
author: Leonardo C. Araujo
author: João P. H. Sansão
author: Adriano S. Vale-Cardoso
published in: Numerical Algorithms
publication date: 2021-09-27T00:00:00Z
Mathematics Subject Classification ID: 65D20
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 7401544
zbMATH Keywords: multinomial coefficient
zbMATH Keywords: discrete Fourier transform
describes a project that uses: Octave
describes a project that uses: Matlab
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s11075-020-01059-5
OpenAlex ID: W3119406166
cites work: Fast computation of binomial coefficients
cites work: Q4769056
cites work: Q5658107
cites work: Maximum likelihood estimation for constrained parameters of multinomial distributions -- appli\-cation to Zipf-Mandelbrot models
cites work: Handbook of Floating-Point Arithmetic
cites work: Fermat's Little Theorem from the Multinomial Theorem
cites work: Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
DOI: 10.1007/S11075-020-01059-5
description: scientific article; zbMATH DE number 7401544