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

DOI10.1007/S00224-024-10162-2MaRDI QIDQ6489321FDOQ6489321

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)

Cites Work

• A sieve algorithm for the shortest lattice vector problem
• Applied functional analysis. Main principles and their applications
• Title not available (Why is that?)
• Deterministic Approximation Algorithms for the Nearest Codeword Problem
• The complexity of the covering radius problem
• New directions in nearest neighbor searching with applications to lattice sieving
• On the Lattice Isomorphism Problem
• Finding closest lattice vectors using approximate Voronoi cells
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• Title not available (Why is that?)
• A note on the distribution of the distance from a lattice
• Progressive lattice sieving
• Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
• The variant of remote set problem on lattices
• The 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)