On the public citation graph

Locally Dense Codes

0 signed · 30 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
inferredcites →https://doi.org/10.1006/jcss.1999.1649openalex-snapshot
Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized Reductions
inferredcites →https://doi.org/10.1007/11818175_8openalex-snapshot
Lattice-Based Cryptography
inferredcites →https://doi.org/10.1007/978-3-540-88702-7_5openalex-snapshot
Lattice-based Cryptography
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_40openalex-snapshot
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
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.1016/s0020-0190(99)00083-6openalex-snapshot
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
inferredcites →https://doi.org/10.1109/18.641542openalex-snapshot
The intractability of computing the minimum distance of a code
inferredcites →https://doi.org/10.1109/tit.2002.806118openalex-snapshot
Hardness of approximating the minimum distance of a linear code
inferredcites →https://doi.org/10.1109/tit.2012.2209198openalex-snapshot
A Deterministic Reduction for the Gap Minimum Distance Problem
inferredcites →https://doi.org/10.1137/s0097539700373039openalex-snapshot
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
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.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.4086/toc.2012.v008a022openalex-snapshot
inferredcites →https://doi.org/10.4086/toc.2012.v008a023openalex-snapshot

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00493-019-4113-1openalex-snapshot
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
inferred← citeshttps://doi.org/10.1049/ipr2.13021openalex-snapshot
An adaptive image compression algorithm based on joint clustering algorithm and deep learning
inferred← citeshttps://doi.org/10.1109/access.2019.2927809openalex-snapshot
UAV Image High Fidelity Compression Algorithm Based on Generative Adversarial Networks Under Complex Disaster Conditions
inferred← citeshttps://doi.org/10.1109/focs.2019.00027openalex-snapshot
SETH-Hardness of Coding Problems
inferred← citeshttps://doi.org/10.1109/tit.2014.2340869openalex-snapshot
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
inferred← citeshttps://doi.org/10.1137/16m1083876openalex-snapshot
Sparse Solutions of Linear Diophantine Equations
inferred← citeshttps://doi.org/10.1145/3444942openalex-snapshot
Parameterized Intractability of Even Set and Shortest Vector Problem
inferred← citeshttps://doi.org/10.1145/3564246.3585214openalex-snapshot
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓ p Norms
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.17openalex-snapshot
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.17openalex-snapshot
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.19openalex-snapshot
Improved Hardness of BDD and SVP Under Gap-(S)ETH
inferred← citeshttps://doi.org/10.48550/arxiv.1910.11850openalex-snapshot
Tight Running Time Lower Bounds for Strong Inapproximability of Maximum $k$-Coverage, Unique Set Cover and Related Problems (via $t$-Wise Agreement Testing Theorem)
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.