Dimension Characterizations of Complexity Classes

  • Authors:

  • Xiaoyang Gu;Jack H. Lutz

  • Affiliations:

  • Iowa State University, Department of Computer Science, 50011, Ames, IA, USA;Iowa State University, Department of Computer Science, 50011, Ames, IA, USA

  • Venue:
  • Computational Complexity
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove a version of the derandomized Direct Product Lemma for deterministic space-bounded algorithms. Suppose a Boolean function $$g : \{0, 1\}^{n} \rightarrow \{0, 1\}$$cannot be computed on more than a fraction 1 − δ ...