On the Complexity of Familiar Functions and Numbers

DOI10.1137/1030134zbMath0686.68029OpenAlexW2109873972MaRDI 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

zbMATH Keywords

algebraic complexityrational complexitydigit complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Radix representation; digital problems (11A63) Approximation by other special function classes (41A30)

Related Items (11)

Computing the asymptotic distribution of second-order \(U\)- and \(V\)-statistics ⋮ Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ Exact Quantization of Multistage Stochastic Linear Problems ⋮ Use of algebraically independent numbers for zero recognition of polynomial terms. ⋮ On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited ⋮ Recurrence relations for rational cubic methods. II: The Chebyshev method ⋮ Reduced complexity evaluation of hypergeometric functions ⋮ The operator approach to entropy games ⋮ Tropical varieties for exponential sums ⋮ On the rapid computation of various polylogarithmic constants ⋮ Asymptotic invariants, complexity of groups and related problems

This page was built for publication: On the Complexity of Familiar Functions and Numbers