3 citations · 7 across the 11 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Efficient and Private Property Testing via Indistinguishability
Cynthia Dwork, Pranay Tankala
Given a small random sample of -bit strings labeled by an unknown Boolean function, which properties of this function can be tested computationally efficiently? We show an equiv…
cs.CC2025
Supersimulators
Cynthia Dwork, Pranay Tankala
We prove that every randomized Boolean function admits a supersimulator: a randomized polynomial-size circuit whose output on random inputs cannot be efficiently distinguished from…