The Choice and Agreement Problems of a Random Function
Information Processing Letters, pp. 16-20, 2018.
Computational complexityAgreeChooseDirect sumKRW composition conjecture
The direct-sum question is a classical question that asks whether performing a task on m independent inputs is m times harder than performing it on a single input. In order to study this question, Beimel et al.  introduced the following related problems:•The choice problem: Given m distinct instances, choose one of them and solve it.•T...More
Full Text (Upload PDF)
PPT (Upload PPT)