Reduced complexity evaluation of hypergeometric functions

Abstract Fast Fourier transform-like techniques can be employed to reduce the complexity of the evaluation of standard approximations to hypergeometric functions and the gamma function. This leads to algorithms that provide n digits of these functions for O (√ n (log n ) 2 ) arithmetic operations. The usual methods require O ( n ) operations for comparable accuracy.