On the Complexity of Familiar Functions and Numbers
From MaRDI portal
Recommendations
Cited in
(17)- Use of algebraically independent numbers for zero recognition of polynomial terms.
- Numerics of analytic functions and complexity
- 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
- Big vee: the story of a function, an algorithm, and three mathematical worlds
- On the rapid computation of various polylogarithmic constants
- Asymptotic invariants, complexity of groups and related problems.
- On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
- Exact Quantization of Multistage Stochastic Linear Problems
- A complexity chasm for solving univariate sparse polynomial equations over p-adic fields
- Complexity of robust orbit problems for torus actions and the abc-conjecture
- On transcendence of numbers related to Sturmian and Arnoux-Rauzy words
- Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games
- Recurrence relations for rational cubic methods. II: The Chebyshev method
- Tropical varieties for exponential sums
This page was built for publication: On the Complexity of Familiar Functions and Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205076)
