On the public citation graph
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
0 signed · 59 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.10068openalex-snapshot
Simple analysis of graph tests for linearity and PCP
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_17openalex-snapshot
Testing Low-Degree Polynomials over GF(2)
inferredcites →https://doi.org/10.1007/978-3-540-85363-3_39openalex-snapshot
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf01200430openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/s00039-001-0332-9openalex-snapshot
A new proof of Szemerédi's theorem
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.1016/s0304-3975(02)00816-2openalex-snapshot
Algebraic testing and weight distributions of codes
inferredcites →https://doi.org/10.1109/18.556674openalex-snapshot
Linearity testing in characteristic two
inferredcites →https://doi.org/10.1109/focs.2004.64openalex-snapshot
Testing Low-Degree Polynomials over Prime Fields
inferredcites →https://doi.org/10.1109/focs.2004.65openalex-snapshot
Testing Polynomials over General Fields
inferredcites →https://doi.org/10.1109/sfcs.1991.185341openalex-snapshot
Approximating clique is almost NP-complete
inferredcites →https://doi.org/10.1109/sfcs.1998.743425openalex-snapshot
Probabilistically checkable proofs with low amortized query complexity
inferredcites →https://doi.org/10.1109/sfcs.2005.16openalex-snapshot
Almost Orthogonal Linear Codes are Locally Testable
inferredcites →https://doi.org/10.1109/tit.1960.1057584openalex-snapshot
Binary codes with specified minimum distance
inferredcites →https://doi.org/10.1137/s009753970444658xopenalex-snapshot
Derandomizing Homomorphism Testing in General Groups
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1137/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1142/9789812562494_0014openalex-snapshot
THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING
inferredcites →https://doi.org/10.1145/1132516.1132519openalex-snapshot
Gowers uniformity, influence of variables, and PCPs
inferredcites →https://doi.org/10.1145/1250790.1250864openalex-snapshot
Low-degree tests at large distances
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/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
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/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/335305.335329openalex-snapshot
A PCP characterization of NP with optimal amortized query complexity
inferredcites →https://doi.org/10.1145/780542.780631openalex-snapshot
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
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.20637openalex-snapshot
A combinatorial characterization of smooth LTCs and applications
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-642-16367-8_6openalex-snapshot
Short Locally Testable Codes and Proofs: A Survey in Two Parts
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_25openalex-snapshot
Short Locally Testable Codes and Proofs
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.1007/978-3-642-32512-0_37openalex-snapshot
Tight Bounds for Testing k-Linearity
inferred← citeshttps://doi.org/10.1007/s00224-015-9639-zopenalex-snapshot
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness
inferred← citeshttps://doi.org/10.1007/s10598-015-9282-1openalex-snapshot
Fault Detection Tests for Stuck-at Faults on Parity Counter Inputs
inferred← citeshttps://doi.org/10.1007/s12095-012-0068-4openalex-snapshot
Applying cube attacks to stream ciphers in realistic scenarios
inferred← citeshttps://doi.org/10.1007/s12095-021-00529-4openalex-snapshot
Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions
inferred← citeshttps://doi.org/10.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferred← citeshttps://doi.org/10.1017/cbo9781139814782openalex-snapshot
Analysis of Boolean Functions
inferred← citeshttps://doi.org/10.1109/ccc.2013.34openalex-snapshot
Strong LTCs with Inverse Polylogarithmic Rate and Soundness
inferred← citeshttps://doi.org/10.1109/focs.2013.43openalex-snapshot
Strong LTCs with Inverse Poly-Log Rate and Constant Soundness
inferred← citeshttps://doi.org/10.1145/2554797.2554842openalex-snapshot
High dimensional expanders and property testing
inferred← citeshttps://doi.org/10.1145/3564246.3585121openalex-snapshot
On Approximability of Satisfiable k-CSPs: III
inferred← citeshttps://doi.org/10.1145/3778165openalex-snapshot
Property Testing with Online Adversaries
inferred← citeshttps://doi.org/10.24963/ijcai.2018/284openalex-snapshot
Behavior of Analogical Inference w.r.t. Boolean Functions
inferred← citeshttps://doi.org/10.4213/dm1170openalex-snapshot
О коэффициентах аддитивности и аффинности дискретных функций
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.90openalex-snapshot
Sublinear-Time Computation in the Presence of Online Erasures
inferred← citeshttps://doi.org/10.48550/arxiv.1312.2367openalex-snapshot
High Dimensional Expanders and Property Testing
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.