Pages that link to "Q93042"
Jump to navigation
Jump to search
The following pages link to Richard P. Brent (Q93042):
Displaying 50 items.
- Andrew Tridgell (Q508095) (← links)
- Brent's method (Q905988) (← links)
- Gene H. Golub (Q1384851) (← links)
- George Forsythe (Q1507260) (← links)
- Andreas Griewank (Q15783303) (← links)
- Algorithms for Minimization without Derivatives (Q55720226) (← links)
- Multiple-Precision Zero-Finding Methods and the Complexity of Elementary Function Evaluation (Q55720484) (← links)
- On the Zeros of the Riemann Zeta Function in the Critical Strip (Q55722647) (← links)
- Some New Algorithms for High-Precision Computation of Euler's Constant (Q55723380) (← links)
- Factorization of the Eighth Fermat Number (Q55723905) (← links)
- Factorization of the Tenth Fermat Number (Q55739200) (← links)
- A primitive trinomial of degree 6972593 (Q55739357) (← links)
- The Great Trinomial Hunt (Q55739409) (← links)
- Fast Multiple-Precision Evaluation of Elementary Functions (Q55887322) (← links)
- An improved Monte Carlo factorization algorithm (Q55953265) (← links)
- Irregularities in the Distribution of Primes and Twin Primes (Q56210593) (← links)
- On the Zeros of the Riemann Zeta Function in the Critical Strip (Q56443173) (← links)
- Factorization of the Eighth Fermat Number (Q56443174) (← links)
- On the Periods of Generalized Fibonacci Recurrences (Q56457051) (← links)
- The Parallel Evaluation of General Arithmetic Expressions (Q56813864) (← links)
- Algebraic Independence of Mahler Functions via Radial Asymptotics (Q56938939) (← links)
- Root optimization of polynomials in the number field sieve (Q56938948) (← links)
- High-Performance Pseudo-Random Number Generation on Graphics Processing Units (Q56938958) (← links)
- Minimum-energy all-to-all multicasting in wireless ad hoc networks (Q56938965) (← links)
- Modern Computer Arithmetic (Q56938970) (← links)
- Ten new primitive binary trinomials (Q56938975) (← links)
- A multi-level blocking distinct-degree factorization algorithm (Q56938982) (← links)
- Faster Multiplication in GF(2)[x] (Q56938989) (← links)
- Error bounds on complex floating-point multiplication (Q56938993) (← links)
- Extracting Significant Phrases from Text (Q56938998) (← links)
- Fast and Reliable Random Number Generators for Scientific Computing (Q56939006) (← links)
- Fast Multiple-Precision Evaluation of Elementary Functions (Q56939014) (← links)
- Note on Marsaglia's Xorshift Random Number Generators (Q56939020) (← links)
- Random Krylov Spaces over Finite Fields (Q56939028) (← links)
- Random Number Generators with Period Divisible by a Mersenne Prime (Q56939034) (← links)
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q56939042) (← links)
- Recent Progress and Prospects for Integer Factorisation Algorithms (Q56939050) (← links)
- Some New Algorithms for High-Precision Computation of Euler’s Constant (Q56939056) (← links)
- 4. Stability of Fast Algorithms for Structured Linear Systems (Q56939064) (← links)
- Some Parallel Algorithms for Integer Factorisation (Q56939072) (← links)
- Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh (Q56939077) (← links)
- Random number generation and simulation on vector and parallel computers (Q56939082) (← links)
- Stability analysis of a general toeplitz systems solver (Q56939091) (← links)
- Computing Aurifeuillian Factors (Q56939103) (← links)
- Ramanujan and Euler’s constant (Q56939118) (← links)
- On computing factors of cyclotomic polynomials (Q56939123) (← links)
- Algorithmic Fault Tolerance Using the Lanczos Method (Q56939138) (← links)
- Parallel Algorithms for Digital Signal Processing (Q56939144) (← links)
- Parallel Algorithms for Toeplitz Systems (Q56939147) (← links)
- A new lower bound for odd perfect numbers (Q56939154) (← links)