On the public citation graph
Local Proofs Approaching the Witness Length
0 signed · 78 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.1002/rsa.20120openalex-snapshot
Robust Locally Testable Codes and Products of Codes
inferredcites →https://doi.org/10.1002/rsa.20498openalex-snapshot
A combination of testability and decodability by tensor products
inferredcites →https://doi.org/10.1007/978-3-030-17653-2_4openalex-snapshot
Aurora: Transparent Succinct Arguments for R1CS
inferredcites →https://doi.org/10.1007/978-3-030-26954-8_23openalex-snapshot
Scalable Zero Knowledge with No Trusted Setup
inferredcites →https://doi.org/10.1007/978-3-030-64378-2_2openalex-snapshot
Linear-Time Arguments with Sublinear Verification from Tensor Codes
inferredcites →https://doi.org/10.1007/978-3-030-64378-2_5openalex-snapshot
Batch Verification and Proofs of Proximity with Polylog Overhead
inferredcites →https://doi.org/10.1007/978-3-031-07085-3_10openalex-snapshot
Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier
inferredcites →https://doi.org/10.1007/978-3-031-07085-3_3openalex-snapshot
A PCP Theorem for Interactive Proofs and Applications
inferredcites →https://doi.org/10.1007/978-3-031-15802-5_18openalex-snapshot
Succinct Interactive Oracle Proofs: Applications and Limitations
inferredcites →https://doi.org/10.1007/978-3-031-15985-5_11openalex-snapshot
Orion: Zero Knowledge Proof with Linear Prover Time
inferredcites →https://doi.org/10.1007/978-3-662-53644-5_2openalex-snapshot
Interactive Oracle Proofs
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/s00037-002-0169-0openalex-snapshot
On interactive proofs with a laconic prover
inferredcites →https://doi.org/10.1007/s00037-013-0074-8openalex-snapshot
Composition of semi-LTCs by two-wise tensor products
inferredcites →https://doi.org/10.1007/s00037-014-0080-5openalex-snapshot
Combinatorial PCPs with Efficient Verifiers
inferredcites →https://doi.org/10.1007/s00037-016-0136-9openalex-snapshot
Non-interactive proofs of proximity
inferredcites →https://doi.org/10.1007/s10472-009-9169-yopenalex-snapshot
Short PCPPs verifiable in polylogarithmic time with O(1) queries
inferredcites →https://doi.org/10.1016/j.ic.2003.09.005openalex-snapshot
Fast approximate probabilistically checkable proofs
inferredcites →https://doi.org/10.1016/j.ipl.2012.01.007openalex-snapshot
The tensor product of two good codes is not necessarily robustly testable
inferredcites →https://doi.org/10.1016/j.jcss.2010.06.007openalex-snapshot
Infeasibility of instance compression and succinct PCPs for NP
inferredcites →https://doi.org/10.1016/s0020-0190(98)00116-1openalex-snapshot
On the complexity of interactive proofs with bounded communication
inferredcites →https://doi.org/10.1109/18.556668openalex-snapshot
Linear-time encodable and decodable error-correcting codes
inferredcites →https://doi.org/10.1109/focs.2017.12openalex-snapshot
Distributed PCP Theorems for Hardness of Approximation in P
inferredcites →https://doi.org/10.1109/focs.2017.82openalex-snapshot
Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions
inferredcites →https://doi.org/10.1109/irepgelc.1954.6499441openalex-snapshot
Application of Boolean algebra to switching circuit design and to error detection
inferredcites →https://doi.org/10.1109/sfcs.1988.21944openalex-snapshot
New algorithms for finding irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1109/tit.1954.1057465openalex-snapshot
A class of multiple-error-correcting codes and the decoding scheme
inferredcites →https://doi.org/10.1109/tit.1972.1054893openalex-snapshot
Class of constructive asymptotically good algebraic codes
inferredcites →https://doi.org/10.1109/tit.2006.872986openalex-snapshot
Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound
inferredcites →https://doi.org/10.1109/tit.2013.2281145openalex-snapshot
An Upper Bound of Singleton Type for Componentwise Products of Linear Codes
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.1137/050646445openalex-snapshot
Short PCPs with Polylog Query Complexity
inferredcites →https://doi.org/10.1137/110829660openalex-snapshot
IP = PSPACE Using Error-Correcting Codes
inferredcites →https://doi.org/10.1137/16m1096773openalex-snapshot
Constant-Round Interactive Proofs for Delegating Computation
inferredcites →https://doi.org/10.1137/s0097539705446962openalex-snapshot
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
inferredcites →https://doi.org/10.1137/s0097539795284959openalex-snapshot
Computationally Sound Proofs
inferredcites →https://doi.org/10.1145/1007352.1007361openalex-snapshot
Robust pcps of proximity, shorter pcps and applications to coding
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/1132516.1132553openalex-snapshot
The PCP theorem by gap amplification
inferredcites →https://doi.org/10.1145/129712.129782openalex-snapshot
A note on efficient zero-knowledge proofs and arguments (extended abstract)
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/2488608.2488681openalex-snapshot
On the concrete efficiency of probabilistically-checkable proofs
inferredcites →https://doi.org/10.1145/2488608.2488709openalex-snapshot
Interactive proofs of proximity
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/2901294openalex-snapshot
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
inferredcites →https://doi.org/10.1145/3051093openalex-snapshot
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
inferredcites →https://doi.org/10.1145/3188745.3188916openalex-snapshot
Hardness of approximate nearest neighbor search
inferredcites →https://doi.org/10.1145/322123.322138openalex-snapshot
Relations Among Complexity Measures
inferredcites →https://doi.org/10.1145/3519935.3520017openalex-snapshot
Asymptotically good Quantum and locally testable classical LDPC codes
inferredcites →https://doi.org/10.1145/3519935.3520024openalex-snapshot
Locally testable codes with constant rate, distance, and locality
inferredcites →https://doi.org/10.1561/0400000084openalex-snapshot
On Doubly-Efficient Interactive Proof Systems
inferredcites →https://doi.org/10.4230/lipics.ccc.2022.24openalex-snapshot
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs
inferredcites →https://doi.org/10.4230/lipics.icalp.2017.40openalex-snapshot
Interactive Oracle Proofs with Constant Rate and Query Complexity
inferredcites →https://doi.org/10.4230/lipics.itcs.2020.9openalex-snapshot
Hard Properties with (Very) Short PCPPs and Their Applications
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-45721-1_25openalex-snapshot
SPARKs: Succinct Parallelizable Arguments of Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-030-84242-0_26openalex-snapshot
Sumcheck Arguments and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-91134-7_5openalex-snapshot
Blaze: Fast SNARKs from Interleaved RAA Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-12287-2_12openalex-snapshot
Linear Prover IOPs in Log Star Rounds
inferred← citeshttps://doi.org/10.1007/978-3-032-25336-1_1openalex-snapshot
Polylogarithmic Proofs for Multilinears over Binary Towers
inferred← citeshttps://doi.org/10.1007/978-3-032-25336-1_4openalex-snapshot
Query-Optimal IOPPs for Linear-Time Encodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-25336-1_5openalex-snapshot
Jagged Polynomial Commitments (or: How to Stack Multilinears)
inferred← citeshttps://doi.org/10.1007/978-3-032-25336-1_8openalex-snapshot
Sum-Check Protocol for Approximate Computations
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_11openalex-snapshot
TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_14openalex-snapshot
Bolt: Faster SNARKs from Sketched Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_19openalex-snapshot
FICS and FACS: Fast IOPPs and Accumulation via Code-Switching
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00083openalex-snapshot
Local Proofs Approaching the Witness Length [Extended Abstract]
inferred← citeshttps://doi.org/10.1137/1.9781611975994.83openalex-snapshot
On the Power of Relaxed Local Decoding Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611975994.84openalex-snapshot
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
inferred← citeshttps://doi.org/10.1137/1.9781611976465.100openalex-snapshot
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy
inferred← citeshttps://doi.org/10.17863/cam.104778openalex-snapshot
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
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.