Pages that link to "Item:Q4205076"
From MaRDI portal
The following pages link to On the Complexity of Familiar Functions and Numbers (Q4205076):
Displayed 10 items.
- Recurrence relations for rational cubic methods. II: The Chebyshev method (Q751193) (← links)
- Tropical varieties for exponential sums (Q785323) (← links)
- Use of algebraically independent numbers for zero recognition of polynomial terms. (Q1426048) (← links)
- Reduced complexity evaluation of hypergeometric functions (Q1819306) (← links)
- Computing the asymptotic distribution of second-order \(U\)- and \(V\)-statistics (Q2157505) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
- The operator approach to entropy games (Q2321934) (← links)
- On the rapid computation of various polylogarithmic constants (Q3127345) (← links)
- Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
- On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited (Q4960229) (← links)