Hardness hypotheses, derandomization, and circuit complexity

  • Authors:

  • John M. Hitchcock;A. Pavan

  • Affiliations:

  • Department of Computer Science, University of Wyoming;Department of Computer Science, Iowa State University

  • Venue:
  • FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider three complexity-theoretic hypotheses that have been studied in different contexts and shown to have many plausible consequences. –The Measure Hypothesis: NP does not have p-measure 0. –The pseudo-NP Hypothesis: there is an NP Language L such that any DTIME $2^{{n^\epsilon}}$ Language L’ can be distinguished from L by an NP refuter. –The NP-Machine Hypothesis: there is an NP machine accepting 0* for which no $2^{{n^\epsilon}}$-time machine can find infinitely many accepting computations. We show that the NP-machine hypothesis is implied by each of the first two. Previously, no relationships were known among these three hypotheses. Moreover, we unify previous work by showing that several derandomization and circuit-size lower bounds that are known to follow from the first two hypotheses also follow from the NP-machine hypothesis. We also consider UP versions of the above hypotheses as well as related immunity and scaled dimension hypotheses.