---
title: "Bibliography"
canonical: "https://docs.magma-maths.org/BasicRings/RealAndComplexFields/bibliography.html"
source: "https://docs.magma-maths.org/BasicRings/RealAndComplexFields/bibliography.md"
part: "Basic Rings"
chapter: "Real and Complex Fields"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Basic Rings", "source": "../index-basic-rings.md"}
  - {"title": "Real and Complex Fields", "source": "index-real-and-complex-fields.md"}
prev: {"title": "Numerical Integration", "source": "integration1.md"}
next: {"title": "Matrices and Linear Algebra", "source": "../../MatricesLinearAlgebra/index-matrices-linear-algebra.md"}
---

# Bibliography

<a id="cite-chand85"></a>
- **[Cha85]** K. Chandrasekharan. *Elliptic Functions*. Volume 281 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin, 1985.
<a id="cite-husem87"></a>
- **[Hus87]** Dale Husemöller. *Elliptic Curves*. Volume 111 of Graduate Texts in Mathematics. Springer, New York, 1987.
<a id="cite-kalelo84"></a>
- **[KLL84]** Ravi Kannan, Arjen K. Lenstra, and László Lovász. Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers. In *Proceedings of the 16th Symposium on the Theory of Computing (STOC 1984)*, 191–200. ACM, 1984.
<a id="cite-koblitz84"></a>
- **[Kob84]** Neal Koblitz. *Introduction to Elliptic Curves and Modular Forms*. Volume 97 of Graduate Texts in Mathematics. Springer, New York, 1984.
<a id="cite-lang87"></a>
- **[Lan87]** Serge Lang. *Elliptic Functions*. Volume 112 of Graduate Texts in Mathematics. Springer, New York, 1987.
<a id="cite-lll"></a>
- **[LLL82]** Arjen K. Lenstra, Hendrik W. Lenstra, and László Lovász. Factoring polynomials with rational coefficients. *Mathematische Annalen*, 261:515–534, 1982.
<a id="cite-lewin81"></a>
- **[Lew81]** Leonard Lewin. *Polylogarithms and associated functions*. North Holland, New York, 1981.
<a id="cite-neurohr-phd"></a>
- **[Neu18]** Christian Neurohr. *Efficient integration on Riemann surfaces & applications*. Dissertation, Carl von Ossietzky Universität Oldenburg, 2018. URL: [http://oops.uni-oldenburg.de/3607](http://oops.uni-oldenburg.de/3607).
<a id="cite-pere06"></a>
- **[PR06]** Y.-F. S. Pétermann and Jean-Luc Rémy. Arbitrary Precision Error Analysis for computing $\zeta(s)$ with the Cohen-Olivier algorithm: Complete description of the real case and preliminary report on the general case. Research Report 5852, INRIA, 2006. http://www.inria.fr/rrrt/rr-5852.html.
<a id="cite-schoenhage82"></a>
- **[Sch82]** A. Schönhage. The fundamental theorem of algebra in terms of computational complexity. Technical Report, Univ. Tübingen, 1982.
<a id="cite-vhoeij2"></a>
- **[vH01]** Mark van Hoeij. Factoring Polynomials and 0-1 vectors. In *Proceedings of the Cryptography and Lattices Conference (CaLC 2001), Brown University, Providence, RI, USA, March 29-30, 2001*, 142–146. Springer, 2001.
<a id="cite-vhoeij1"></a>
- **[vH02]** Mark van Hoeij. Factoring Polynomials and the knapsack problem. *J. Number Th.*, 95(2):167–189, 2002. http://www.math.fsu.edu/$\sim$hoeij/paper/knapsack.ps.
<a id="cite-whit15"></a>
- **[WW15]** E. T. Whittaker and G. N. Watson. *A course of modern analysis*. Cambridge University Press, Cambridge, 2nd edition, 1915.
<a id="cite-zagier89"></a>
- **[Zag]** D. Zagier. “Polylogarithms, Dedekind Zeta Functions, and the Algebraic $K$-Theory of Fields.” 377–390.