The following pages link to Modern Computer Arithmetic (Q3060337):
Displaying 50 items.
- Continued fraction inequalities for the Euler-Mascheroni constant (Q257885) (← links)
- New lattice attacks on DSA schemes (Q293717) (← links)
- An algorithm for calculating logarithms through displacement (Q357911) (← links)
- Multiple-correction and continued fraction approximation (Q482775) (← links)
- A simple and fast online power series multiplication and its analysis (Q492037) (← links)
- On an efficient inclusion method for finding polynomial zeros (Q492088) (← links)
- Multipoint methods for solving nonlinear equations: a survey (Q505804) (← links)
- New higher-order methods for the simultaneous inclusion of polynomial zeros (Q639989) (← links)
- Missing a trick: Karatsuba variations (Q680912) (← links)
- A new sequence convergent to Euler-Mascheroni constant (Q824509) (← links)
- Multiple-correction and continued fraction approximation. II (Q1643291) (← links)
- Construction and efficiency of multipoint root-ratio methods for finding multiple zeros (Q1715792) (← links)
- A deterministic algorithm for finding \(r\)-power divisors (Q2093686) (← links)
- Frobenius action on a hypergeometric curve and an algorithm for computing values of Dwork's \(p\)-adic hypergeometric functions (Q2097066) (← links)
- A fast algorithm for computing the number of magic series (Q2155555) (← links)
- On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants (Q2168701) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- Multiple-correction and faster approximation (Q2254226) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- Truncation bounds for differentially finite series (Q2323059) (← links)
- On an efficient simultaneous method for finding polynomial zeros (Q2345285) (← links)
- On a high-order one-parameter family for the simultaneous determination of polynomial roots (Q2411134) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- Matrix arithmetic-geometric mean and the computation of the logarithm (Q2813335) (← links)
- Recursive Double-Size Fixed Precision Arithmetic (Q2819221) (← links)
- Computing Class Polynomials for Abelian Surfaces (Q2875530) (← links)
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions (Q2967967) (← links)
- Scaling and modified squaring method for the matrix exponential (Q3121465) (← links)
- Formal Verification of Exact Computations Using Newton’s Method (Q3183542) (← links)
- The Borwein Brothers, Pi and the AGM (Q3298036) (← links)
- Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights (Q4560706) (← links)
- Computing period matrices and the Abel-Jacobi map of superelliptic curves (Q4561377) (← links)
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective (Q4561383) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- Fast integer multiplication using generalized Fermat primes (Q4612576) (← links)
- Efficient quantum algorithms for state measurement and linear algebra applications (Q4620263) (← links)
- An exponent one-fifth algorithm for deterministic integer factorisation (Q4956932) (← links)
- Computing Hypergeometric Functions Rigorously (Q4960950) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- A log-log speedup for exponent one-fifth deterministic integer factorisation (Q5070544) (← links)
- A bound for the error term in the Brent-McMillan algorithm (Q5264130) (← links)
- Optimization of quantum Hamiltonian evolution: From two projection operators to local Hamiltonians (Q5370945) (← links)
- AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM (Q5495473) (← links)
- Exponentially more precise quantum simulation of fermions in second quantization (Q5854995) (← links)
- Tensors in computations (Q5887832) (← links)
- Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-\(p\) base \(\beta\) (Q6038798) (← links)
- Fast and accurate computation of the Euclidean norm of a vector (Q6072363) (← links)
- Phragmén's voting methods and justified representation (Q6120935) (← links)
- 2-D lossless FIR filter design using synthesis of the paraunitary transfer function matrix (Q6127934) (← links)
- Rounding error analysis of linear recurrences using generating series (Q6163326) (← links)
