Pseudorandomness for Approximate Counting and Sampling

  • Authors:

  • Ronen Shaltiel;Christopher Umans

  • Affiliations:

  • Department of Computer Science, University of Haifa, Haifa, Israel 31905;Department of Computer Science, California Institute of Technology, Pasadena, USA 91125

  • Venue:
  • Computational Complexity
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study computational procedures that use both randomness and nondeterminism. The goal of this paper is to derandomize such procedures under the weakest possible assumptions.Our main technical contribution allows one to "boost" a given hardness assumption: We show that if there is a problem in EXP that cannot be computed by poly-size nondeterministic circuits then there is one which cannot be computed by poly-size circuits that make non-adaptive NP oracle queries. This in particular shows that the various assumptions used over the last few years by several authors to derandomize Arthur-Merlin games (i.e., show AM = NP) are in fact all equivalent.We also define two new primitives that we regard as the natural pseudorandom objects associated with approximate counting and sampling of NP-witnesses. We use the "boosting" theorem and hashing techniques to construct these primitives using an assumption that is no stronger than that used to derandomize AM.We observe that Cai's proof that $$\rm S^{P}_{2} \subseteq ZPP^{NP}$$ and the learning algorithm of Bshouty et al. can be seen as reductions to sampling that are not probabilistic. As a consequence they can be derandomized under an assumption which is weaker than the assumption that was previously known to suffice.