-
2
-
-
84968483662
-
Numerical results on relations between numerical constants using a new algorithm
-
D.H. Bailey and H.R.P. Ferguson, "Numerical results on relations between numerical constants using a new algorithm," Mathematics of Computation 53 (1989), 649-656.
-
(1989)
Mathematics of Computation
, vol.53
, pp. 649-656
-
-
Bailey, D.H.1
Ferguson, H.R.P.2
-
3
-
-
0003587202
-
A polynomial time, numerically stable integer relation algorithm
-
D.H. Bailey and H.R.P. Ferguson, "A polynomial time, numerically stable integer relation algorithm," RNR Technical Report, RNR-91-032.
-
RNR Technical Report
, vol.RNR-91-032
-
-
Bailey, D.H.1
Ferguson, H.R.P.2
-
5
-
-
0022078267
-
Decreasing the nesting depth of expressions involving square roots
-
A. Borodin, R. Fagin, J.E. Hopcroft, and M. Tompa, "Decreasing the nesting depth of expressions involving square roots," J. Symbolic Comp. 1 (1985), 169-188.
-
(1985)
J. Symbolic Comp.
, vol.1
, pp. 169-188
-
-
Borodin, A.1
Fagin, R.2
Hopcroft, J.E.3
Tompa, M.4
-
6
-
-
0004058071
-
-
Wiley-Interscience, John Wiley & Sons, Toronto
-
J.M. Borwein and P.B. Borwein, Pi and the AGM, Wiley-Interscience, John Wiley & Sons, Toronto, p. 384 1987.
-
(1987)
Pi and the AGM
, pp. 384
-
-
Borwein, J.M.1
Borwein, P.B.2
-
7
-
-
0346204079
-
Searching symbolically for Apéry-like formulae for values of the Riemann zeta function
-
J.M. Borwein and D.M. Bradley, "Searching symbolically for Apéry-like formulae for values of the Riemann zeta function," SIGSAM Bulletin of Symbolic and Algebraic Manipulation, 30(2) (1996), 2-7.
-
(1996)
SIGSAM Bulletin of Symbolic and Algebraic Manipulation
, vol.30
, Issue.2
, pp. 2-7
-
-
Borwein, J.M.1
Bradley, D.M.2
-
8
-
-
0031283914
-
Empirically determined Apéry-like formulae for ζ (4n + 3)
-
J.M. Borwein and D.M. Bradley, "Empirically determined Apéry-like formulae for ζ (4n + 3)," Experimental Mathematics 6 (1997), 181-194.
-
(1997)
Experimental Mathematics
, vol.6
, pp. 181-194
-
-
Borwein, J.M.1
Bradley, D.M.2
-
9
-
-
84966244815
-
Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
-
H.R.P. Ferguson and R.W. Forcade, "Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two," Bulletin of the American Mathematical Society 1 (1979), 912-914.
-
(1979)
Bulletin of the American Mathematical Society
, vol.1
, pp. 912-914
-
-
Ferguson, H.R.P.1
Forcade, R.W.2
-
10
-
-
0003766834
-
-
Oxford University Press, New York
-
G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers, 5th edition, Oxford University Press, New York, p. 148, 1979.
-
(1979)
An Introduction to the Theory of Numbers, 5th Edition
, pp. 148
-
-
Hardy, G.H.1
Wright, E.M.2
-
11
-
-
0024748719
-
Polynomial time algorithms for finding integer relations among real numbers
-
J. Hastad, B. Just, J.C. Lagarias, and C.P. Schnorr, "Polynomial time algorithms for finding integer relations among real numbers," SIAM Journal on Computing 18 (1988), 859-881.
-
(1988)
SIAM Journal on Computing
, vol.18
, pp. 859-881
-
-
Hastad, J.1
Just, B.2
Lagarias, J.C.3
Schnorr, C.P.4
-
12
-
-
34250244723
-
Factoring polynomials with rational coefficients
-
A.K. Lenstra, H.W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Math. Annalen, 261 (1982), 515-534.
-
(1982)
Math. Annalen
, vol.261
, pp. 515-534
-
-
Lenstra, A.K.1
Lenstra, H.W.2
Lovasz, L.3
-
16
-
-
0022078742
-
Simplifications of expressions involving radicals
-
R. Zippel, "Simplifications of expressions involving radicals," J. Symbolic Comp. 1 (1985), 189-210.
-
(1985)
J. Symbolic Comp.
, vol.1
, pp. 189-210
-
-
Zippel, R.1
|