Applications of integer relation algorithms
From MaRDI portal
Publication:1978174
DOI10.1016/S0012-365X(99)00256-3zbMATH Open0959.68134OpenAlexW1980758215MaRDI QIDQ1978174FDOQ1978174
Authors: 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
Recommendations
Cited In (13)
- Discovering and Proving Infinite Pochhammer Sum Identities
- Discovering and Proving Infinite Binomial Sums Identities
- Analysis of PSLQ, an integer relation finding algorithm
- Parallel integer relation detection: techniques and applications
- Central Binomial Sums, Multiple Clausen Values, and Zeta Values
- Extending the PSLQ Algorithm to Algebraic Integer Relations
- The PSLQ algorithm for empirical data
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- Period computations for covers of elliptic curves
- A complete algorithm to find exact minimal polynomial by approximations
- Special values of multiple polylogarithms
- A noninductive GL(n, Z) algorithm that constructs integral linear relations for n Z-linearly dependent real numbers
This page was built for publication: Applications of integer relation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978174)