Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
From MaRDI portal
approximation algorithmscomputational number theorycontinued fractioninteger relationmultidimensional Euclidean algorithm
Lattices and convex bodies (number-theoretic aspects) (11H06) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Continued fractions and generalizations (11J70) Number-theoretic algorithms; complexity (11Y16) Continued fraction calculations (number-theoretic aspects) (11Y65) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- scientific article; zbMATH DE number 3980478
- Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers
- Polynomial time over the reals with parsimony
- Using integer relations algorithms for finding relationships among functions
- Applications of integer relation algorithms
- Integer complexity: algorithms and computational results
- On the algorithmic complexity of some numeration-related problems
- Polynomial time operations in explicit mathematics
- Complexity of computation on real algebraic numbers
- A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
Cited in
(41)- Factoring polynomials over global fields
- Simultaneously good bases of a lattice and its reciprocal lattice
- Distances from differences of roots of polynomials to the nearest integers
- Improved low-density subset sum algorithms
- On the hardness of approximating shortest integer relations among rational numbers
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Real data-integer solution problems within the Blum-Shub-Smale computational model
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Applications of integer relation algorithms
- Towards faster polynomial-time lattice reduction
- Fast LLL-type lattice reduction
- Parallel integer relation detection: techniques and applications
- A linear algorithm for nonhomogeneous spectra of numbers
- Extending the PSLQ Algorithm to Algebraic Integer Relations
- A Short Proof of the Existence of Vector Euclidean Algorithms
- scientific article; zbMATH DE number 3980478 (Why is no real title available?)
- A noninductive GL(n, Z) algorithm that constructs integral linear relations for n Z-linearly dependent real numbers
- scientific article; zbMATH DE number 1186951 (Why is no real title available?)
- scientific article; zbMATH DE number 17811 (Why is no real title available?)
- scientific article; zbMATH DE number 45475 (Why is no real title available?)
- Numerical results on relations between fundamental constants using a new algorithm
- Analysis of PSLQ, an integer relation finding algorithm
- Experimental Evaluation of Euler Sums
- A natural lattice basis problem with applications
- Complexity results for some eigenvector problems
- The PSLQ algorithm for empirical data
- Thrackles: an improved upper bound
- An optimal, stable continued fraction algorithm for arbitrary dimension
- Complex Dimensions of Self-Similar Fractal Strings and Diophantine Approximation
- Cloud-assisted LLL: a secure and efficient outsourcing algorithm for approximate shortest vector problem
- Selected applications of LLL in number theory
- A numerical transcendental method in algebraic geometry: computation of Picard groups and related invariants
- Recovering exact results from inexact numerical data in algebraic geometry
- Random sampling revisited: lattice enumeration with discrete pruning
- On finite-precision representations of geometric objects
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- Trilateration using unlabeled path or loop lengths
- Rational approximations, multidimensional continued fractions, and lattice reduction
- Transcendental methods in numerical algebraic geometry
- An improved lower bound for approximating shortest integer relation in \(\ell _{\infty }\) norm \((SIR_{\infty })\)
This page was built for publication: Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033848)
