On the public citation graph
Linear-Consistency Testing
0 signed · 27 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/(sici)1099-0690(199910)1999:10<2545::aid-ejoc2545>3.3.co;2-1openalex-snapshot
inferredcites →https://doi.org/10.1007/3-540-61680-2_47openalex-snapshot
Positive linear programming, parallel approximation and PCP's
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1109/18.556674openalex-snapshot
Linearity testing in characteristic two
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1137/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1145/167088.167174openalex-snapshot
Efficient probabilistically checkable proofs and applications to approximations
inferredcites →https://doi.org/10.1145/200836.200880openalex-snapshot
Designing programs that check their work
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/276698.276769openalex-snapshot
Recycling queries in PCPs and in linearity tests (extended abstract)
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.10068openalex-snapshot
Simple analysis of graph tests for linearity and PCP
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-0-387-30162-4_202openalex-snapshot
Linearity Testing/Testing Hadamard Codes
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_202openalex-snapshot
Linearity Testing/Testing Hadamard Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_7openalex-snapshot
Designated-Verifier SNARGs with One Group Element
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_39openalex-snapshot
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
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-27848-8_202-2openalex-snapshot
Linearity and Group Homomorphism Testing/Testing Hadamard Codes
inferred← citeshttps://doi.org/10.1109/ccc.2001.933891openalex-snapshot
Simple analysis of graph tests for linearity and PCP
inferred← citeshttps://doi.org/10.1137/070681612openalex-snapshot
Gowers Uniformity, Influence of Variables, and PCPs
inferred← citeshttps://doi.org/10.1137/080715548openalex-snapshot
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
inferred← citeshttps://doi.org/10.1145/1132516.1132519openalex-snapshot
Gowers uniformity, influence of variables, and PCPs
inferred← citeshttps://doi.org/10.1145/2422436.2422461openalex-snapshot
On the power of many one-bit provers
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.