Applications of integer relation algorithms

DOI10.1016/S0012-365X(99)00256-3zbMath0959.68134OpenAlexW1980758215MaRDI QIDQ1978174

Petr Lisoněk, Jonathan M. Borwein

Publication date: 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00256-3

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Packaged methods for numerical algorithms (65Y15)

Related Items (8)

Special values of multiple polylogarithms ⋮ Period computations for covers of elliptic curves ⋮ Discovering and Proving Infinite Pochhammer Sum Identities ⋮ Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms ⋮ Discovering and Proving Infinite Binomial Sums Identities ⋮ The PSLQ algorithm for empirical data ⋮ Central Binomial Sums, Multiple Clausen Values, and Zeta Values ⋮ A complete algorithm to find exact minimal polynomial by approximations

This page was built for publication: Applications of integer relation algorithms