On the public citation graph
A 3-Query Non-Adaptive PCP with Perfect Completeness
0 signed · 36 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/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/pl00009809openalex-snapshot
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates
inferredcites →https://doi.org/10.1109/sfcs.1998.743424openalex-snapshot
A tight characterization of NP with 3 query PCPs
inferredcites →https://doi.org/10.1109/sfcs.2002.1181879openalex-snapshot
Hardness results for coloring 3-colorable 3-uniform hypergraphs
inferredcites →https://doi.org/10.1109/sfcs.2002.1181880openalex-snapshot
The hardness of 3-uniform hypergraph coloring
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1145/195058.195129openalex-snapshot
Improved non-approximability results
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/335305.335329openalex-snapshot
A PCP characterization of NP with optimal amortized query complexity
inferredcites →https://doi.org/10.5555/314613.314701openalex-snapshot
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20549openalex-snapshot
A query efficient non-adaptive long code test with perfect completeness
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_56openalex-snapshot
Sound 3-Query PCPPs Are Long
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_55openalex-snapshot
A Query Efficient Non-adaptive Long Code Test with Perfect Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_20openalex-snapshot
Query-Efficient Dictatorship Testing with Perfect Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_15openalex-snapshot
On the NP-Hardness of Max-Not-2
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_28openalex-snapshot
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.010openalex-snapshot
On the hardness of learning intersections of two halfspaces
inferred← citeshttps://doi.org/10.1038/s41467-020-15240-wopenalex-snapshot
Playing games with multiple access channels
inferred← citeshttps://doi.org/10.1109/ccc.2010.19openalex-snapshot
On the Unique Games Conjecture (Invited Survey)
inferred← citeshttps://doi.org/10.1137/1.9781611973099.58openalex-snapshot
Bypassing UGC from some Optimal Geometric Inapproximability Results
inferred← citeshttps://doi.org/10.1137/1.9781611973402.117openalex-snapshot
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs
inferred← citeshttps://doi.org/10.1145/1374376.1374426openalex-snapshot
On hardness of learning intersection of two halfspaces
inferred← citeshttps://doi.org/10.1145/1536414.1536482openalex-snapshot
Conditional hardness for satisfiable 3-CSPs
inferred← citeshttps://doi.org/10.1145/2737729openalex-snapshot
Bypassing UGC from Some Optimal Geometric Inapproximability Results
inferred← citeshttps://doi.org/10.1145/3717823.3718127openalex-snapshot
On Approximability of Satisfiable 𝑘-CSPs: V
inferred← citeshttps://doi.org/10.48550/arxiv.0811.1922openalex-snapshot
A Hypergraph Dictatorship Test with Perfect Completeness
inferred← citeshttps://doi.org/10.5555/1496770.1496811openalex-snapshot
3-bit dictator testing: 1 vs. 5/8
inferred← citeshttps://doi.org/10.5555/2634074.2634191openalex-snapshot
Hardness of finding independent sets in 2-colorable and almost 2-colorable hypergraphs
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.