On the public citation graph

Tolerant Versus Intolerant Testing for Boolean Properties

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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.10078openalex-snapshot
Three theorems regarding testing graph properties
inferredcites →https://doi.org/10.1002/rsa.10110openalex-snapshot
Functions that have read‐twice constant width branching programs are not necessarily testable
inferredcites →https://doi.org/10.1006/jcss.1999.1692openalex-snapshot
Spot-Checkers
inferredcites →https://doi.org/10.1007/978-1-4615-0013-1_15openalex-snapshot
Property Testing
inferredcites →https://doi.org/10.1007/s004930070001openalex-snapshot
Efficient Testing of Large Graphs
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/j.ic.2003.09.005openalex-snapshot
Fast approximate probabilistically checkable proofs
inferredcites →https://doi.org/10.1016/j.ic.2004.10.001openalex-snapshot
Fast approximate PCPs for multidimensional bin-packing problems
inferredcites →https://doi.org/10.1016/j.jcss.2003.11.004openalex-snapshot
Testing juntas
inferredcites →https://doi.org/10.1016/j.jcss.2006.03.002openalex-snapshot
Tolerant property testing and distance approximation
inferredcites →https://doi.org/10.1137/s0097539700366528openalex-snapshot
Regular Languages are Testable with a Constant Number of Queries
inferredcites →https://doi.org/10.1137/s0097539704442416openalex-snapshot
Quantum Property Testing
inferredcites →https://doi.org/10.1137/s0097539704445445openalex-snapshot
Some 3CNF Properties Are Hard to Test
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.1137/s0895480101407444openalex-snapshot
Testing Basic Boolean Formulae
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/100216.100225openalex-snapshot
Self-testing/correcting with applications to numerical problems
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/1060590.1060612openalex-snapshot
Testing versus estimation of graph properties
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/276698.276757openalex-snapshot
Spot-checkers
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/301250.301267openalex-snapshot
Fast approximate PCPs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11538462_26openalex-snapshot
Tolerant Locally Testable Codes
inferred← citeshttps://doi.org/10.1007/11830924_43openalex-snapshot
Distance Approximation in Bounded-Degree and General Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_56openalex-snapshot
Sound 3-Query PCPPs Are Long
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.033openalex-snapshot
Testing whether a digraph contains H-free k-induced subgraphs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00108openalex-snapshot
New Lower Bounds for Adaptive Tolerant Junta Testing
inferred← citeshttps://doi.org/10.1137/1.9781611976465.98openalex-snapshot
On Efficient Distance Approximation for Graph Properties
inferred← citeshttps://doi.org/10.1145/1060590.1060612openalex-snapshot
Testing versus estimation of graph properties
inferred← citeshttps://doi.org/10.1145/3717823.3718277openalex-snapshot
Polynomial-Time Tolerant Testing Stabilizer States
inferred← citeshttps://doi.org/10.1145/3717823.3718290openalex-snapshot
A Tolerant Independent Set Tester
inferred← citeshttps://doi.org/10.3217/jucs-012-06-0710openalex-snapshot
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
inferred← citeshttps://doi.org/10.4086/toc.2006.v002a009openalex-snapshot
inferred← citeshttps://doi.org/10.46298/theoretics.22.1openalex-snapshot
Robustly Self-Ordered Graphs: Constructions and Applications to 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.