The following pages link to Gauss' algorithm revisited (Q3988821):
Displaying 13 items.
- Convex minization over \(\mathbb Z^2\) (Q631217) (← links)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- An upper bound on the average number of iterations of the LLL algorithm (Q1314406) (← links)
- The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) (← links)
- Satins, lattices, and extended Euclid's algorithm (Q2070141) (← links)
- How to pick a random integer matrix? (and other questions) (Q2792341) (← links)
- Revisiting the Gentry-Szydlo Algorithm (Q2874510) (← links)
- Linear Bandwidth Naccache-Stern Encryption (Q3540055) (← links)
- The Generalized Gauss Reduction Algorithm (Q3837387) (← links)
- Computing Jacobi’s theta in quasi-linear time (Q4605708) (← links)
- On pairwise Gaussian bases and LLL algorithm for three dimensional lattices (Q5053992) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- LATIN 2004: Theoretical Informatics (Q5901667) (← links)
