Equivalence between efficient sample-based property testing and structured symmetry via computable partitions, with a supersimulator lemma proved via graph regularity iteration.
Kim, Omer Reingold, and Udi Wieder
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CC 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Every randomized Boolean function admits a supersimulator that fools polynomially larger distinguishers, yielding a tighter characterization of when product distributions are computationally indistinguishable.
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.
-
Supersimulators
Every randomized Boolean function admits a supersimulator that fools polynomially larger distinguishers, yielding a tighter characterization of when product distributions are computationally indistinguishable.