The Choice and Agreement Problems of a Random Function

Information Processing Letters, pp. 16-20, 2018.

Cited by: 0|Bibtex|Views14|Links
EI
Keywords:
Computational complexityAgreeChooseDirect sumKRW composition conjecture

Abstract:

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. [3] introduced the following related problems:•The choice problem: Given m distinct instances, choose one of them and solve it.•T...More

Code:

Data:

Your rating :
0

 

Tags
Comments