Arithmetic complexity of the Stirling transforms

DOI10.1515/DMA-2015-0008zbMath1348.65046OpenAlexW2318849896MaRDI QIDQ314124

Sergey B. Gashkov

Publication date: 13 September 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2015-0008

zbMATH Keywords

Lagrange interpolationVandermonde matricesaddition vector chainscircuits in arithmetic basescomplexity of computationGauss \(q\)-binomial coefficientNewton interpolationStirling transforms of the first and second kinds

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Numerical interpolation (65D05) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

On the additive complexity of GCD and LCM matrices

This page was built for publication: Arithmetic complexity of the Stirling transforms