References
- E. Bach, Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms, Cambridge, MIT Press, 1985.
- J. Brillhart, Note on representing a prime as a sum of two squares, Math. Comp. 26(1972) 1011–1013.
- S. Chowla, The Riemann Hypothesis and Hilbert's Tenth Problem, New York, Gordon and Breach, 1965.
- G. Cornacchia, Su di un metodo per la risoluzione in numeri interi dell'equazione Σh=0nChxn-hyh = P, Giornale di Matematiche di Battaglini, 46(1908) 33–90.
- H. Davenport, The Higher Arithmetic, 5th ed., Cambridge Univ. Pr., Cambridge, 1984.
- D. Flath, Introduction to Number Theory, Wiley, New York, 1989.
- K. Hardy, J. B. Muskat, and K. S. Williams, A deterministic algorithm for solving n = fu2 + gv2 in coprirne intergers u and v, Math. Comp., forthcoming.
- C. Hermite, Note au sujet de l'article précédent, J. Math. Pures Appl., 5(1848) 15.
- I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, second ed., New York, Wiley, 1966.
- R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp., 44 (1985) 483–494.
- J. A. Serret, Sur un théorème rélatif aux nombres entières, J. Math. Pures Appi., 5 (1848) 12–14.
- P. Wilker, An efficient algorithmic solution of the Diophantine equation u2 + 5v2 = m, Math. Comp., 35(1976) 1347–1352.