On the public citation graph

https://doi.org/10.4086/toc.2012.v008a023

0 signed · 68 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.1002/0471722154openalex-snapshot
The Probabilistic Method
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.1006/jcss.1999.1686openalex-snapshot
On the Limits of Nonapproximability of Lattice Problems
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/978-3-642-88330-9openalex-snapshot
Symmetric Bilinear Forms
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
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.1007/s00493-003-0019-yopenalex-snapshot
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
inferredcites →https://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
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.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.1089025openalex-snapshot
Lattice problems in NP ∩ coNP
inferredcites →https://doi.org/10.1145/1089023.1089027openalex-snapshot
Hardness of approximating the shortest vector problem in lattices
inferredcites →https://doi.org/10.1145/1132516.1132581openalex-snapshot
Lattice problems and norm embeddings
inferredcites →https://doi.org/10.1145/1536414.1536421openalex-snapshot
A deterministic reduction for the gap minimum distance problem
inferredcites →https://doi.org/10.1145/167088.167174openalex-snapshot
Efficient probabilistically checkable proofs and applications to approximations
inferredcites →https://doi.org/10.1145/1806689.1806739openalex-snapshot
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
inferredcites →https://doi.org/10.1145/237814.237838openalex-snapshot
Generating hard instances of lattice problems (extended abstract)
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.1145/380752.380857openalex-snapshot
A sieve algorithm for the shortest lattice vector problem
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.4086/toc.2012.v008a022openalex-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/978-3-030-84245-1_25openalex-snapshot
Lattice Reduction with Approximate Enumeration Oracles
inferred← citeshttps://doi.org/10.1007/978-3-032-35377-1_8openalex-snapshot
Hardness of Hinted ISIS from the Space-Time Hardness of Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-29814-6_4openalex-snapshot
On Promise Problem of the Generalized Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-50011-9_10openalex-snapshot
The Variant of Remote Set Problem on Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_40openalex-snapshot
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
inferred← citeshttps://doi.org/10.1007/s00037-016-0151-xopenalex-snapshot
List-Decoding Barnes–Wall Lattices
inferred← citeshttps://doi.org/10.1007/s11464-014-0429-8openalex-snapshot
Restricted parameter range promise set cover problems are easy
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.05.003openalex-snapshot
Improved hardness results for unique shortest vector problem
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/j.tcs.2014.10.011openalex-snapshot
Lower bounds of shortest vector lengths in random NTRU lattices
inferred← citeshttps://doi.org/10.1109/ccc.2012.33openalex-snapshot
List Decoding Barnes-Wall Lattices
inferred← citeshttps://doi.org/10.1109/ccc.2014.17openalex-snapshot
Locally Dense Codes
inferred← citeshttps://doi.org/10.1109/ccc.2014.18openalex-snapshot
On the Closest Vector Problem with a Distance Guarantee
inferred← citeshttps://doi.org/10.1109/focs.2015.41openalex-snapshot
Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!
inferred← citeshttps://doi.org/10.1109/focs.2017.11openalex-snapshot
On the Quantitative Hardness of CVP
inferred← citeshttps://doi.org/10.1109/focs.2018.00032openalex-snapshot
Non-Black-Box Worst-Case to Average-Case Reductions within NP
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/1.9781611974331.ch121openalex-snapshot
Discrete Gaussian Sampling Reduces to CVP and SVP
inferred← citeshttps://doi.org/10.1137/100811970openalex-snapshot
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
inferred← citeshttps://doi.org/10.1137/17m1132045openalex-snapshot
Voronoi Cells of Lattices with Respect to Arbitrary Norms
inferred← citeshttps://doi.org/10.1137/19m124705xopenalex-snapshot
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
inferred← citeshttps://doi.org/10.1137/23m1573021openalex-snapshot
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) Norms
inferred← citeshttps://doi.org/10.1145/2746539.2746606openalex-snapshot
Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
inferred← citeshttps://doi.org/10.1145/3188745.3188840openalex-snapshot
(Gap/S)ETH hardness of SVP
inferred← citeshttps://doi.org/10.1145/3452143.3465517openalex-snapshot
On the Smallest Ratio Problem of Lattice Bases
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.1145/3564246.3585227openalex-snapshot
Lattice Problems beyond Polynomial Time
inferred← citeshttps://doi.org/10.1145/3586165.3586172openalex-snapshot
The Complexity of the Shortest Vector Problem
inferred← citeshttps://doi.org/10.1145/3798129.3800803openalex-snapshot
Deterministic Hardness of Approximation of Unique-SVP and GapSVP in ℓ p Norms for p>2
inferred← citeshttps://doi.org/10.1287/opre.2017.1705openalex-snapshot
Inverse Optimization with Noisy Data
inferred← citeshttps://doi.org/10.3390/a14120362openalex-snapshot
Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm
inferred← citeshttps://doi.org/10.3390/math9080858openalex-snapshot
Revisiting Multivariate Ring Learning with Errors and Its Applications on Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.3929/ethz-a-007242748openalex-snapshot
Security proofs in number theoretic cryptography
inferred← citeshttps://doi.org/10.4086/toc.2012.v008a022openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2015.v011a007openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2016.v012a002openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.gs.2011.002openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.36openalex-snapshot
Hardness of Bounded Distance Decoding on Lattices in $\ell_p$ Norms
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.1409.8063openalex-snapshot
On the Closest Vector Problem with a Distance Guarantee
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)
inferred← citeshttps://doi.org/10.62056/a3wahey6bopenalex-snapshot
Scaling Lattice Sieves across Multiple Machines
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.