The following pages link to Paul Zimmermann (Q412201):
Displaying 50 items.
- Non-linear polynomial selection for the number field sieve (Q412202) (← links)
- Landau's function for one million billions (Q1026978) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294) (← links)
- Efficient isolation of polynomial's real roots. (Q1421215) (← links)
- (Q1853633) (redirect page) (← links)
- Density results on floating-point invertible numbers. (Q1853634) (← links)
- A proof of GMP square root (Q1868507) (← links)
- The middle product algorithm. I: Speeding up the division and square root of power series (Q1879478) (← links)
- Function composition and automatic average case analysis (Q1894000) (← links)
- Is normal backwardation normal? Valuing financial futures with a local index-rate covariance (Q2076945) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- The role of the leverage effect in the price discovery process of credit markets (Q2246685) (← links)
- Corrigendum to ``A long note on Mulders' short product'' (Q2252124) (← links)
- Proposal for a standardization of mathematical function implementation in floating-point arith\-metic (Q2387784) (← links)
- Computing predecessor and successor in rounding to nearest (Q2391021) (← links)
- A long note on Mulders' short product (Q2643515) (← links)
- Better polynomials for GNFS (Q2792346) (← links)
- The great trinomial hunt (Q3001822) (← links)
- Ten new primitive binary trinomials (Q3055140) (← links)
- Modern Computer Arithmetic (Q3060337) (← links)
- Finding Optimal Formulae for Bilinear Maps (Q3166980) (← links)
- Searching worst cases of a one-variable function using lattice reduction (Q3417011) (← links)
- Error bounds on complex floating-point multiplication (Q3433764) (← links)
- Factorization in Z[x] (Q3454736) (← links)
- MPFR (Q3549209) (← links)
- Factorization of a 768-Bit RSA Modulus (Q3582763) (← links)
- (Q3635536) (← links)
- (Q4035669) (← links)
- On sums of seven cubes (Q4240596) (← links)
- The n-Queens Problem (Q4324550) (← links)
- GFUN (Q4371576) (← links)
- Computational Mathematics with SageMath (Q4631554) (← links)
- A primitive trinomial of degree 6972593 (Q4654034) (← links)
- Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials (Q4664835) (← links)
- (Q4730781) (← links)
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397) (← links)
- Numerical approximation of The Masser-Gramain constant to four decimal digits: $\delta = 1.819...$ (Q4912025) (← links)
- An O(M(n) logn) Algorithm for the Jacobi Symbol (Q4931642) (← links)
- A new ranking function for polynomial selection in the number field sieve (Q4998643) (← links)
- Division-Free Binary-to-Decimal Conversion (Q5268093) (← links)
- (Q5301655) (← links)
- (Q5301666) (← links)
- Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format (Q5302769) (← links)
- Faster Multiplication in GF(2)[x] (Q5387595) (← links)
- Discrete Logarithm in GF(2809) with FFS (Q5402973) (← links)
- Algorithmic Number Theory (Q5465641) (← links)
- Aliquot Sequence 3630 Ends After Reaching 100 Digits (Q5472018) (← links)
- Reliable Computing with GNU MPFR (Q5747854) (← links)
- Three Cousins of Recaman's Sequence (Q5868563) (← links)
