The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...