Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
From MaRDI portal
(Redirected from Publication:757465)
Recommendations
Cites work
- scientific article; zbMATH DE number 3849336 (Why is no real title available?)
- scientific article; zbMATH DE number 3980484 (Why is no real title available?)
- scientific article; zbMATH DE number 3282420 (Why is no real title available?)
- scientific article; zbMATH DE number 3294843 (Why is no real title available?)
- scientific article; zbMATH DE number 3030237 (Why is no real title available?)
- scientific article; zbMATH DE number 3061641 (Why is no real title available?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- Die Reduktionstheorie der positiven quadratischen Formen
- Factoring polynomials with rational coefficients
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- On Lovász' lattice reduction and the nearest lattice point problem
Cited in
(75)- Improvements in closest point search based on dual HKZ-bases
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
- A uniform stability principle for dual lattices
- Enumeration and unimodular equivalence of empty delta-modular simplices
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
- The Generalized Basis Reduction Algorithm
- Non-standard approaches to integer programming
- Nonembeddability theorems via Fourier analysis
- Discrete analogues of John's theorem
- Slide reduction, successive minima and several~applications
- scientific article; zbMATH DE number 3908520 (Why is no real title available?)
- A new bound for the orthogonality defect of HKZ reduced lattices
- Sieving for closest lattice vectors (with preprocessing)
- Analysis of PSLQ, an integer relation finding algorithm
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Approximating the densest sublattice from Rankin's inequality
- Lamination and antilamination of Euclidean lattices
- Some inequalities related to the Seysen measure of a lattice
- Simultaneous reduction of a lattice basis and its reciprocal basis
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász
- Hardness of approximating the closest vector problem with pre-processing
- More on average case vs approximation complexity
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- Simultaneously good bases of a lattice and its reciprocal lattice
- Euclidean lattices, theta invariants, and thermodynamic formalism
- Covering sets for plane lattices
- Linear dependence among Hecke eigenvalues
- Dual vectors and lower bounds for the nearest lattice point problem
- On the successive minima of subbases of low-dimensional lattices
- Hermitian vector bundles and extension groups on arithmetic schemes. I: Geometry of numbers
- New bounds in some transference theorems in the geometry of numbers
- Area-diameter and area-width relations for covering plane sets
- Reduction of Smith normal form transformation matrices
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Lattice inequalities for convex bodies and arbitrary lattices
- On the limits of nonapproximability of lattice problems
- Tight bounds on discrete quantitative Helly numbers
- Multidimensional extremal Logan's and Bohman's problems
- Counting ideals in ray classes
- Lattice reformulation cuts
- Generalized degree and optimal Loewner-type inequalities
- On the ability to approximate k-DSP of HKZ, BKZ and slide reduction
- The inapproximability of lattice and coding problems with preprocessing
- Hermite’s Constant and Lattice Algorithms
- Sur un problème de dualité lié aux sphères en géométrie des nombres. (On a duality problem related to spheres in geometry of numbers)
- A randomized sieving algorithm for approximate integer programming
- Explicit Hard Instances of the Shortest Vector Problem
- On successive minima and intrinsic volumes
- Sharper bounds on four lattice constants
- New Korkin–Zolotarev Inequalities
- Structure versus hardness through the obfuscation lens
- Simple sufficient conditions for integer stabilizability of discrete-time systems with relative degree one
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Successive minima, intrinsic volumes, and lattice determinants
- Improved Rounding for Spline Coefficients and Knots
- On the number of integer points in a multidimensional domain
- Towards faster polynomial-time lattice reduction
- Block Reduced Lattice Bases and Successive Minima
- On the smallest ratio problem of lattice bases
- Optimal inapproximability with universal factor graphs
- Theta invariants and lattice-point counting in normed \(\mathbb{Z}\)-modules
- An upper bound on the number of perfect quadratic forms
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension
- A hierarchy of polynomial time lattice basis reduction algorithms
- Short bases of lattices over number fields
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
- A lattice-based public-key cryptosystem
- Hyperelliptic surfaces are Loewner
- scientific article; zbMATH DE number 1670828 (Why is no real title available?)
- Estimates of lengths of shortest nonzero vectors in some lattices. I
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.
- Centerpoints: a link between optimization and convex geometry
This page was built for publication: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757465)
