Pages that link to "Item:Q1812812"
From MaRDI portal
The following pages link to Numerics of analytic functions and complexity (Q1812812):
Displaying 18 items.
- Computing Dirichlet character sums to a power-full modulus (Q401979) (← links)
- On the analytic complexity of discriminants (Q461040) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- A nearly-optimal method to compute the truncated theta function, its derivatives, and integrals (Q640803) (← links)
- Fast methods to compute the Riemann zeta function (Q640804) (← links)
- Estimating the extremal eigenvalues of a symmetric matrix (Q753418) (← links)
- Multiplication is the easiest nontrivial arithmetic function (Q1066671) (← links)
- On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Separable asymptotic cost of evaluating elementary functions (Q1587035) (← links)
- Effective asymptotics of linear recurrences with rational coefficients (Q1917520) (← links)
- A fast algorithm to compute \(L(1/2, f\times \chi_q)\) (Q1937300) (← links)
- Effective analytic functions (Q2456553) (← links)
- Complex function theory and numerical analysis (Q2503997) (← links)
- New Computations of the Riemann Zeta Function on the Critical Line (Q4643729) (← links)
- Decomposition of Functions of Finite Analytical Complexity (Q5853324) (← links)
- Theory and Applications of Models of Computation (Q5898892) (← links)
