Elsevier

Journal of Complexity

Volume 10, Issue 4, December 1994, Pages 445-450
Journal of Complexity

Regular Article
There Exists a Problem Whose Computational Complexity Is Any Given Function of the Information Complexity

https://doi.org/10.1006/jcom.1994.1024Get rights and content
Under a Creative Commons license
open archive

Abstract

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.

Cited by (0)