Equivalence between efficient sample-based property testing and structured symmetry via computable partitions, with a supersimulator lemma proved via graph regularity iteration.
, Diptaksho Palit, and Sofya Raskhodnikova
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient and Private Property Testing via Indistinguishability
Equivalence between efficient sample-based property testing and structured symmetry via computable partitions, with a supersimulator lemma proved via graph regularity iteration.