On the public citation graph

Succinct Certificates for Almost All Subset Sum Problems

https://doi.org/10.1137/0218037
0 signed · 49 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.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
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/bf01580682openalex-snapshot
Integer programming approaches to the travelling salesman problem
inferredcites →https://doi.org/10.1007/bf01582116openalex-snapshot
On the symmetric travelling salesman problem I: Inequalities
inferredcites →https://doi.org/10.1007/bf02128669openalex-snapshot
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
inferredcites →https://doi.org/10.1007/bfb0120887openalex-snapshot
On the symmetric travelling salesman problem: Solution of a 120-city problem
inferredcites →https://doi.org/10.1016/0012-365x(76)90068-6openalex-snapshot
Hamiltonian circuits in random graphs
inferredcites →https://doi.org/10.1016/0020-0190(82)90110-7openalex-snapshot
Average time analysis of simplified Davis-Putnam procedures
inferredcites →https://doi.org/10.1016/0020-0190(84)90013-9openalex-snapshot
Backtrack: An O(1) expected time algorithm for the graph coloring problem
inferredcites →https://doi.org/10.1016/0166-218x(83)90017-3openalex-snapshot
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
inferredcites →https://doi.org/10.1016/0196-6774(84)90032-4openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1137/0206046openalex-snapshot
Determining the Stability Number of a Graph
inferredcites →https://doi.org/10.1137/0208001openalex-snapshot
Determining the Chromatic Number of a Graph
inferredcites →https://doi.org/10.1137/0208040openalex-snapshot
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
inferredcites →https://doi.org/10.1137/0215038openalex-snapshot
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
inferredcites →https://doi.org/10.1137/1.9781611970203openalex-snapshot
An Algorithmic Theory of Numbers, Graphs and Convexity
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1146/annurev.cs.02.060187.001311openalex-snapshot
Algorithmic Geometry of Numbers
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.1287/opre.28.6.1402openalex-snapshot
Hard Knapsack Problems
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0093openalex-snapshot
Basis Reduction Methods
inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/rsa.10004openalex-snapshot
Phase transition and finite‐size scaling for the integer partitioning problem
inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_4openalex-snapshot
An Improved Low-Density Subset Sum Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-46665-7_29openalex-snapshot
Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_8openalex-snapshot
Super-bits, demi-bits, and NP/qpoly-natural proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-41326-1_7openalex-snapshot
Improved Hybrid Attack via Error-Splitting Method for Finding Quinary Short Lattice Vectors
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_9openalex-snapshot
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_23openalex-snapshot
Solving Random Subset Sum Problem by l p -norm SVP Oracle
inferred← citeshttps://doi.org/10.1007/bf00189260openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferred← citeshttps://doi.org/10.1007/bf01201999openalex-snapshot
Improved low-density subset sum algorithms
inferred← citeshttps://doi.org/10.1007/s10107-022-01828-1openalex-snapshot
On the integrality gap of binary integer programs with Gaussian data
inferred← citeshttps://doi.org/10.1090/psapm/042/1095552openalex-snapshot
The rise and fall of knapsack cryptosystems
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63484openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferred← citeshttps://doi.org/10.1137/1.9781611977554openalex-snapshot
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferred← citeshttps://doi.org/10.1145/2554797.2554838openalex-snapshot
Integer feasibility of random polytopes
inferred← citeshttps://doi.org/10.1145/780542.780602openalex-snapshot
The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice
inferred← citeshttps://doi.org/10.33540/2424openalex-snapshot
Branch-and-bound trees, integrality gaps and online optimization
inferred← citeshttps://doi.org/10.4086/toc.2007.v004a002openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2008.v004a002openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.0807.3355openalex-snapshot
Parallel Approximation and Integer Programming Reformulation
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0023openalex-snapshot
Branching proofs of infeasibility in low density subset sum problems
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01078openalex-snapshot
On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound
inferred← citeshttps://doi.org/10.48550/arxiv.2203.11863openalex-snapshot
Integrality Gaps for Random Integer Programs via 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.