9 citations · 11 across the 3 of their papers we have counts for
1 paper · 1 filter
Thomas Holenstein, Grant Schoenebeck
We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the fir…