On the public citation graph
A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
0 signed · 57 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.1006/jcss.1997.1238openalex-snapshot
Fully Parallelized Multi-prover Protocols for NEXP-Time
inferredcites →https://doi.org/10.1007/3-540-52282-4_30openalex-snapshot
Hiding instances in multioracle queries
inferredcites →https://doi.org/10.1007/3-540-60615-7openalex-snapshot
Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems
inferredcites →https://doi.org/10.1007/3-540-63248-4_7openalex-snapshot
A combinatorial consistency lemma with application to proving the PCP theorem
inferredcites →https://doi.org/10.1007/978-1-4612-1872-2_5openalex-snapshot
A Taxonomy of Proof Systems
inferredcites →https://doi.org/10.1007/978-3-0348-9110-3_2openalex-snapshot
Transparent Proofs and Limits to Approximation
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1109/fscs.1990.89520openalex-snapshot
Nondeterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1109/istcs.1995.377032openalex-snapshot
Some improvements to total degree tests
inferredcites →https://doi.org/10.1109/sct.1988.5275openalex-snapshot
On the power of multi-power interactive protocols
inferredcites →https://doi.org/10.1109/sfcs.1991.185341openalex-snapshot
Approximating clique is almost NP-complete
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1109/sfcs.1992.267824openalex-snapshot
Probabilistic checking of proofs; a new characterization of NP
inferredcites →https://doi.org/10.1109/sfcs.1995.492573openalex-snapshot
Free bits, PCPs and non-approximability-towards tight results
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/100216.100225openalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/103418.103429openalex-snapshot
Self-testing/correcting for polynomials and for approximate functions
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/167088.167174openalex-snapshot
Efficient probabilistically checkable proofs and applications to approximations
inferredcites →https://doi.org/10.1145/195058.195129openalex-snapshot
Improved non-approximability results
inferredcites →https://doi.org/10.1145/258533.258641openalex-snapshot
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
inferredcites →https://doi.org/10.1145/62212.62223openalex-snapshot
Multi-prover interactive proofs: how to remove intractability
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.20120openalex-snapshot
Robust Locally Testable Codes and Products of Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_39openalex-snapshot
The Structure of Winning Strategies in Parallel Repetition Games
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_5openalex-snapshot
Combinatorial Algorithms for Distributed Graph Coloring
inferred← citeshttps://doi.org/10.1007/s00037-011-0013-5openalex-snapshot
Derandomized Parallel Repetition via Structured PCPs
inferred← citeshttps://doi.org/10.1007/s00037-015-0111-xopenalex-snapshot
Combinatorial PCPs with Short Proofs
inferred← citeshttps://doi.org/10.1007/s00037-016-0149-4openalex-snapshot
Low-degree test with polynomially small error
inferred← citeshttps://doi.org/10.1007/s00446-013-0203-2openalex-snapshot
Combinatorial algorithms for distributed graph coloring
inferred← citeshttps://doi.org/10.1109/ccc.2010.11openalex-snapshot
Derandomized Parallel Repetition of Structured PCPs
inferred← citeshttps://doi.org/10.1109/ccc.2012.14openalex-snapshot
Combinatorial PCPs with Short Proofs
inferred← citeshttps://doi.org/10.1109/focs.2008.26openalex-snapshot
Locally Testing Direct Product in the Low Error Range
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00059openalex-snapshot
Constant Degree Direct Product Testers with Small Soundness
inferred← citeshttps://doi.org/10.1137/080734030openalex-snapshot
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
inferred← citeshttps://doi.org/10.1137/09077299xopenalex-snapshot
New Direct-Product Testers and 2-Query PCPs
inferred← citeshttps://doi.org/10.1137/21m1397684openalex-snapshot
Agreement Tests on Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1137/s0097539705446810openalex-snapshot
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
inferred← citeshttps://doi.org/10.1137/s0097539705446962openalex-snapshot
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
inferred← citeshttps://doi.org/10.1145/1007352.1007361openalex-snapshot
Robust pcps of proximity, shorter pcps and applications to coding
inferred← citeshttps://doi.org/10.1145/1374376.1374460openalex-snapshot
Uniform direct product theorems
inferred← citeshttps://doi.org/10.1145/1536414.1536435openalex-snapshot
New direct-product testers and 2-query PCPs
inferred← citeshttps://doi.org/10.1145/2897518.2897523openalex-snapshot
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
inferred← citeshttps://doi.org/10.1145/3369939openalex-snapshot
Toward a General Direct Product Testing Theorem
inferred← citeshttps://doi.org/10.1145/3564246.3585121openalex-snapshot
On Approximability of Satisfiable k-CSPs: III
inferred← citeshttps://doi.org/10.1145/3564246.3585189openalex-snapshot
Hardness Self-Amplification: Simplified, Optimized, and Unified
inferred← citeshttps://doi.org/10.1145/3618260.3649714openalex-snapshot
Characterizing Direct Product Testing via Coboundary Expansion
inferred← citeshttps://doi.org/10.1145/3717823.3718197openalex-snapshot
Quasi-Linear Size PCPs with Small Soundness from HDX
inferred← citeshttps://doi.org/10.1145/3802807.3802813openalex-snapshot
Size-Efficient PCPs from High-Dimensional Expanders
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2018.58openalex-snapshot
Erasures vs. Errors in Local Decoding and Property Testing
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2018.11openalex-snapshot
Towards a General Direct Product Testing Theorem
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.