Pages that link to "Item:Q4088201"
From MaRDI portal
The following pages link to Fast Multiple-Precision Evaluation of Elementary Functions (Q4088201):
Displaying 37 items.
- Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time (Q2492797) (← links)
- Matrix arithmetic-geometric mean and the computation of the logarithm (Q2813335) (← links)
- Computing Class Polynomials for Abelian Surfaces (Q2875530) (← links)
- Effective genericity and differentiability (Q2930874) (← links)
- A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space (Q2958350) (← links)
- A STUDY ON THE RANDOMNESS OF THE DIGITS OF π (Q3025093) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Computing prime harmonic sums (Q3055200) (← links)
- The Borwein Brothers, Pi and the AGM (Q3298036) (← links)
- Foundations of Exact Rounding (Q3605482) (← links)
- New Complexity Bounds for Image Matching under Rotation and Scaling (Q3637109) (← links)
- In Praise of Numerical Computation (Q3644734) (← links)
- Une méthodologie du calcul hardware des fonctions élémentaires (Q3750023) (← links)
- Efficient Multiple-Precision Evaluation of Elementary Functions (Q3805743) (← links)
- A Rigorous Time Bound for Factoring Integers (Q4019632) (← links)
- A Real Number Structure that is Effectively Categorical (Q4243908) (← links)
- Detecting perfect powers in essentially linear time (Q4396462) (← links)
- Computations of class numbers of real quadratic fields (Q4396463) (← links)
- Fast Computation of Some Special Integrals of Mathematical Physics (Q4577102) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- Fast evaluation of bessel functions (Q4837514) (← links)
- Complexity of Operators on Compact Sets (Q4918033) (← links)
- (Q5150651) (← links)
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields (Q5418498) (← links)
- Computing present values by the AGM (Q5422810) (← links)
- Regularity of Conjugacies between Critical Circle Maps: An Experimental Study (Q5472020) (← links)
- Complexity, decidability and completeness (Q5480615) (← links)
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications (Q5928297) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
- The Elliptic Integral Machine: A Collision-based Model of Computation (Q6078863) (← links)
- On the Order of Power Series and the Sum of Square Roots Problem (Q6081955) (← links)
- Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method (Q6173465) (← links)
- Computing error bounds for asymptotic expansions of regular P-recursive sequences (Q6181106) (← links)
- Unscented Kalman filter with stable embedding for simple, accurate, and computationally efficient state estimation of systems on manifolds in Euclidean space (Q6190232) (← links)
- Feasible real random access machines (Q6560189) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
- Cyclotomic identity testing and applications (Q6666517) (← links)