On the Complexity of Familiar Functions and Numbers
From MaRDI portal
Publication:4205076
DOI10.1137/1030134zbMath0686.68029MaRDI QIDQ4205076
Jonathan M. Borwein, Peter B. Borwein
Publication date: 1988
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1030134
68Q25: Analysis of algorithms and problem complexity
11A63: Radix representation; digital problems
41A30: Approximation by other special function classes
Related Items
On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited, Recurrence relations for rational cubic methods. II: The Chebyshev method, Tropical varieties for exponential sums, Use of algebraically independent numbers for zero recognition of polynomial terms., Reduced complexity evaluation of hypergeometric functions, Computing the asymptotic distribution of second-order \(U\)- and \(V\)-statistics, Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields, The operator approach to entropy games, On the rapid computation of various polylogarithmic constants, Asymptotic invariants, complexity of groups and related problems