The following pages link to Richard P. Brent (Q472408):
Displaying 35 items.
- Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials (Q4664835) (← links)
- A Note on Downdating the Cholesky Factorization (Q4727270) (← links)
- (Q4763622) (← links)
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397) (← links)
- (Q4842413) (← links)
- An O(M(n) logn) Algorithm for the Jacobi Symbol (Q4931642) (← links)
- (Q4945780) (← links)
- Three new factors of Fermat numbers (Q4955877) (← links)
- Accurate estimation of sums over zeros of the Riemann zeta-function (Q4956931) (← links)
- ON THE ACCURACY OF ASYMPTOTIC APPROXIMATIONS TO THE LOG-GAMMA AND RIEMANN–SIEGEL THETA FUNCTIONS (Q4972093) (← links)
- Reproducibility in Computational Science: A Case Study: Randomness of the Digits of Pi (Q4976184) (← links)
- The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations (Q4999423) (← links)
- A HARMONIC SUM OVER NONTRIVIAL ZEROS OF THE RIEMANN ZETA-FUNCTION (Q4999615) (← links)
- (Q5180855) (← links)
- The Distribution of Small Gaps Between Successive Primes (Q5181413) (← links)
- Generalising Tuenter's binomial sums (Q5246242) (← links)
- A bound for the error term in the Brent-McMillan algorithm (Q5264130) (← links)
- Root optimization of polynomials in the number field sieve (Q5264135) (← links)
- A stabilized parallel algorithm for direct-form recursive filters (Q5375395) (← links)
- Faster Multiplication in GF(2)[x] (Q5387595) (← links)
- On minors of maximal determinant matrices (Q5404307) (← links)
- An algorithm with guaranteed convergence for finding a zero of a function (Q5639291) (← links)
- (Q5657612) (← links)
- Reducing the retrieval time of scatter storage techniques (Q5664801) (← links)
- The Parallel Evaluation of Arithmetic Expressions Without Division (Q5666165) (← links)
- Some Efficient Algorithms for Solving Systems of Nonlinear Equations (Q5674319) (← links)
- On the Precision Attainable with Various Floating-Point Number Systems (Q5676995) (← links)
- The First Occurrence of Large Gaps Between Successive Primes (Q5686084) (← links)
- Fast Computation of Bernoulli, Tangent and Secant Numbers (Q5746436) (← links)
- FFT Extension for Algebraic-Group Factorization Algorithms (Q5888182) (← links)
- Introduction (Q5896102) (← links)
- Asymptotic approximation of central binomial coefficients with rigorous error bounds (Q6276612) (← links)
- The mean square of the error term in the prime number theorem (Q6347056) (← links)
- On some results of Agelas concerning the GRH and of Vassilev-Missana concerning the prime zeta function (Q6363038) (← links)
- Some instructive mathematical errors (Q6370209) (← links)
