New Results on the Remote Set Problem and Its Applications in Complexity Study

DOI10.1007/S00224-024-10162-2MaRDI QIDQ6489321zbMATH OpenFDO

Authors Yijie Chen, Kewei Lv

Publication date 21 April 2024

Published in Theory of Computing Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Geometry of numbers (11Hxx)

Recommendations

• The remote set problem on lattices
• The remote set problem on lattices
• The variant of remote set problem on lattices
• On the Lattice Isomorphism Problem
• The reductions for the approximating covering radius problem

Cites work

• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• A note on the distribution of the distance from a lattice
• A sieve algorithm for the shortest lattice vector problem
• Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
• Applied functional analysis. Main principles and their applications
• Deterministic Approximation Algorithms for the Nearest Codeword Problem
• Faster exponential time algorithms for the shortest vector problem
• Finding closest lattice vectors using approximate Voronoi cells
• New directions in nearest neighbor searching with applications to lattice sieving
• On the Lattice Isomorphism Problem
• Progressive lattice sieving
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• The complexity of the covering radius problem
• The remote set problem on lattices
• The variant of remote set problem on lattices

This page was built for publication: New Results on the Remote Set Problem and Its Applications in Complexity Study

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