Pages that link to "Item:Q814418"

The following pages link to The complexity of the covering radius problem (Q814418):

Displaying 23 items.

• New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
• On covering problems of codes (Q675858) (← links)
• Angle covers: algorithms and complexity (Q782165) (← links)
• A note on the distribution of the distance from a lattice (Q1006407) (← links)
• On the number of lattice points in a small sphere and a recursive lattice decoding algorithm (Q1934244) (← links)
• Covering a simplex by spheres: complexity and algorithms (Q2162517) (← links)
• Linear discrepancy is \(\Pi_2\)-hard to approximate (Q2234789) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• The complexity of coverage (Q2841992) (← links)
• Covering radius of two-dimensional lattices (Q2858312) (← links)
• Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
• Complexity and algorithms for computing Voronoi cells of lattices (Q3055167) (← links)
• The Geometry of Lattice Cryptography (Q3092183) (← links)
• The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
• (Q4352782) (← links)
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
• The Restricted Isometry Property of Subsampled Fourier Matrices (Q5278293) (← links)
• Covering Radius of Matrix Codes Endowed with the Rank Metric (Q5346567) (← links)
• Algorithms and Data Structures (Q5394235) (← links)
• On the Lattice Isomorphism Problem (Q5414599) (← links)
• Towards uniform online spherical tessellations (Q5918678) (← links)
• Some questions related to the reverse Minkowski theorem (Q6198650) (← links)
• New Results on the Remote Set Problem and Its Applications in Complexity Study (Q6489321) (← links)