There Exists a Problem Whose Computational Complexity is Any Given Function of the Information Complexity

We present an information-based complexity problem for which the computational complexity can be any given increasing function of the information complexity, and the information complexity can be any non-decreasing function of ε-1, where ε is the error parameter