On the public citation graph
Dual vectors and lower bounds for the nearest lattice point problem
0 signed · 28 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/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1686openalex-snapshot
On the Limits of Nonapproximability of Lattice Problems
inferred← citeshttps://doi.org/10.1007/10722028_1openalex-snapshot
The Complexity of Some Lattice Problems
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_11openalex-snapshot
A New Transference Theorem in the Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/978-3-031-38548-3_2openalex-snapshot
Does the Dual-Sieve Attack on Learning with Errors Even Work?
inferred← citeshttps://doi.org/10.1007/978-3-319-63688-7_23openalex-snapshot
Structure vs. Hardness Through the Obfuscation Lens
inferred← citeshttps://doi.org/10.1007/bf01445125openalex-snapshot
New bounds in some transference theorems in the geometry of numbers
inferred← citeshttps://doi.org/10.1007/bf01446883openalex-snapshot
Simultaneously good bases of a lattice and its reciprocal lattice
inferred← citeshttps://doi.org/10.1007/bf02574039openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n
inferred← citeshttps://doi.org/10.1007/s00037-011-0029-xopenalex-snapshot
More on Average Case vs Approximation Complexity
inferred← citeshttps://doi.org/10.1007/s00145-025-09560-7openalex-snapshot
Accurate Score Prediction for Dual-Sieve Attacks
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.002openalex-snapshot
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00216-0openalex-snapshot
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00058-9openalex-snapshot
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
inferred← citeshttps://doi.org/10.1109/18.651011openalex-snapshot
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
inferred← citeshttps://doi.org/10.1109/ccc.1999.766274openalex-snapshot
Some recent progress on the complexity of lattice problems
inferred← citeshttps://doi.org/10.1109/ccc.1999.766278openalex-snapshot
Applications of a new transference theorem to Ajtai's connection factor
inferred← citeshttps://doi.org/10.1109/focs.2004.31openalex-snapshot
Hardness of Approximating the Shortest Vector Problem in Lattices
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238204openalex-snapshot
More on average case vs approximation complexity
inferred← citeshttps://doi.org/10.1137/17m1136559openalex-snapshot
Structure Versus Hardness Through the Obfuscation Lens
inferred← citeshttps://doi.org/10.1145/1089023.1089027openalex-snapshot
Hardness of approximating the shortest vector problem in lattices
inferred← citeshttps://doi.org/10.1145/3313276.3316397openalex-snapshot
On approximating the covering radius and finding dense lattice subspaces
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.