On the public citation graph
Hardness of the Covering Radius Problem on Lattices
0 signed · 42 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-46521-9_22openalex-snapshot
Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard
inferredcites →https://doi.org/10.1007/978-3-540-28629-5_19openalex-snapshot
Group Coloring and List Group Coloring Are Π2 P -Complete
inferredcites →https://doi.org/10.1007/978-3-662-04565-7_29openalex-snapshot
Hardness of Approximation
inferredcites →https://doi.org/10.1007/978-3-662-21711-5_16openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1007/bf01204720openalex-snapshot
Lattice translates of a polytope and the Frobenius problem
inferredcites →https://doi.org/10.1007/bf01279452openalex-snapshot
On the longest circuit in an alterable digraph
inferredcites →https://doi.org/10.1007/s00037-005-0193-yopenalex-snapshot
The complexity of the covering radius problem
inferredcites →https://doi.org/10.1007/s00493-003-0019-yopenalex-snapshot
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/j.jcss.2005.07.002openalex-snapshot
Hardness of approximating the Shortest Vector Problem in high ℓp norms
inferredcites →https://doi.org/10.1016/s0304-3975(01)00290-0openalex-snapshot
Approximating SVP∞ to within almost-polynomial factors is NP-hard
inferredcites →https://doi.org/10.1098/rspa.1992.0004openalex-snapshot
Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
inferredcites →https://doi.org/10.1109/ccc.2002.1004339openalex-snapshot
Sampling short lattice vectors and the closest lattice vector problem
inferredcites →https://doi.org/10.1109/focs.2004.31openalex-snapshot
Hardness of Approximating the Shortest Vector Problem in Lattices
inferredcites →https://doi.org/10.1109/sfcs.1998.743433openalex-snapshot
Approximating-CVP to within almost-polynomial factors is NP-hard
inferredcites →https://doi.org/10.1109/tit.1984.1056978openalex-snapshot
The complexity of computing the covering radius of a code
inferredcites →https://doi.org/10.1137/0604005openalex-snapshot
The Optimal Lattice Quantizer in Three Dimensions
inferredcites →https://doi.org/10.1137/s0097539703433511openalex-snapshot
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
inferredcites →https://doi.org/10.1145/1089023.1089027openalex-snapshot
Hardness of approximating the shortest vector problem in lattices
inferredcites →https://doi.org/10.1145/276698.276705openalex-snapshot
The shortest vector problem in L 2 is NP -hard for randomized reductions (extended abstract)
inferredcites →https://doi.org/10.4153/cjm-1956-033-4openalex-snapshot
The Covering Of Space By Spheres
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-07082-2_23openalex-snapshot
On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_27openalex-snapshot
A Local-Global Approach to Solving Ideal Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_28openalex-snapshot
Modular Form Approach to Solving Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_14openalex-snapshot
Inapproximability Results for Computational Problems on Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_16openalex-snapshot
The Remote Set Problem on Lattices
inferred← citeshttps://doi.org/10.1007/s00037-008-0251-3openalex-snapshot
Limits on the Hardness of Lattice Problems in ℓ p Norms
inferred← citeshttps://doi.org/10.1007/s00037-014-0094-zopenalex-snapshot
The remote set problem on lattices
inferred← citeshttps://doi.org/10.1007/s00454-008-9123-5openalex-snapshot
A Note on the Distribution of the Distance from a Lattice
inferred← citeshttps://doi.org/10.1007/s00493-020-4633-8openalex-snapshot
Computing the Covering Radius of a Polytope with an Application to Lonely Runners
inferred← citeshttps://doi.org/10.1145/1806689.1806739openalex-snapshot
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
inferred← citeshttps://doi.org/10.1145/3313276.3316397openalex-snapshot
On approximating the covering radius and finding dense lattice subspaces
inferred← citeshttps://doi.org/10.4230/lipics.socg.2015.704openalex-snapshot
Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings
inferred← citeshttps://doi.org/10.48550/arxiv.1311.6671openalex-snapshot
A Deterministic Polynomial Space Construction for eps-nets under any Norm
inferred← citeshttps://doi.org/10.48550/arxiv.2008.00044openalex-snapshot
On the Computational Complexity of Linear Discrepancy
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.