Pages that link to "Item:Q3033848"
From MaRDI portal
The following pages link to Polynomial Time Algorithms for Finding Integer Relations among Real Numbers (Q3033848):
Displayed 19 items.
- An improved lower bound for approximating shortest integer relation in \(\ell _{\infty }\) norm \((SIR_{\infty })\) (Q845926) (← links)
- Factoring polynomials over global fields (Q1032662) (← links)
- Simultaneously good bases of a lattice and its reciprocal lattice (Q1119682) (← links)
- Distances from differences of roots of polynomials to the nearest integers (Q1199554) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
- Simultaneous reduction of a lattice basis and its reciprocal basis (Q1311020) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Real data-integer solution problems within the Blum-Shub-Smale computational model (Q1368838) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Parallel integer relation detection: Techniques and applications (Q2723541) (← links)
- Analysis of PSLQ, an integer relation finding algorithm (Q4221985) (← links)
- Experimental Evaluation of Euler Sums (Q4313619) (← links)
- A natural lattice basis problem with applications (Q4396454) (← links)
- Complexity results for some eigenvector problems (Q4521209) (← links)
- Complex Dimensions of Self-Similar Fractal Strings and Diophantine Approximation (Q4811490) (← links)
- Selected Applications of LLL in Number Theory (Q5188543) (← links)
- Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry (Q5298836) (← links)