On the complexity of calculating factorials

DOI10.1016/0196-6774(85)90006-9zbMath0576.68027OpenAlexW2085517579WikidataQ56672111 ScholiaQ56672111MaRDI QIDQ3696513

Peter B. Borwein

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90006-9

zbMATH Keywords

time complexityprime factors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (9)

On the approximation of Catalan numbers and other quantities ⋮ Counting and sampling orientations on chordal graphs ⋮ A fast algorithm for computing the number of magic series ⋮ Stirling’s Original Asymptotic Series from a Formula Like One of Binet’s and its Evaluation by Sequence Acceleration ⋮ Ranking and Unranking of Non-regular Trees ⋮ Polynomial expressions for non-binomial structures ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ Linear differential equations as a data structure ⋮ On Shapley value interpretability in concept-based learning with formal concept analysis

This page was built for publication: On the complexity of calculating factorials