Computing efficiently the lattice width in any dimension

DOI10.1016/J.TCS.2011.02.009zbMATH Open1221.68259OpenAlexW2090032031MaRDI QIDQ638564FDOQ638564

Authors: Émilie Charrier, Fabien Feschet, Lilian Buzer 

Publication date: 12 September 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00827179/file/article_TCS.pdf

Recommendations

• Efficient lattice width computation in arbitrary dimension
• Efficient algorithms for discrete lattice calculations
• Lattice computers for approximating Euclidean space
• Computing the writhe on lattices
• Computing a lattice basis revisited
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Fast lattice point enumeration with minimal overhead
• Computing rank-width exactly
• An Efficient Data Structure for Lattice Operations
• Rigorous and Efficient Short Lattice Vectors Enumeration

zbMATH Keywords

greedy algorithmlattice widthshortest vector

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Integer programming (90C10)

Cites Work

• Integer Programming with a Fixed Number of Variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Polynomial Algorithm for the Two-Variable Integer Programming Problem
• Title not available (Why is that?)
• Production Sets with Indivisibilities, Part I: Generalities
• Title not available (Why is that?)
• Finding Extremal Polygons
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• Simultaneous inner and outer approximation of shapes
• On integer points in polyhedra
• Higher dimensional continued fractions
• Computing the width of a set
• Minimal ellipsoids and maximal simplexes in 3D Euclidean space
• A linear algorithm for integer programming in the plane
• The Generalized Gauss Reduction Algorithm
• Finding a shortest vector in a two-dimensional lattice modulo m
• Title not available (Why is that?)
• Sieve algorithms for the shortest vector problem are practical
• Efficient lattice width computation in arbitrary dimension
• Computing Two-Dimensional Integer Hulls
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Lattice size and generalized basis reduction in dimension three
• Computing rank-width exactly
• Efficient lattice width computation in arbitrary dimension
• On factorization invariants and Hilbert functions
• Computing the covering radius of a polytope with an application to lonely runners

This page was built for publication: Computing efficiently the lattice width in any dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638564)