Time-Space Tradeoffs in the Counting Hierarchy

  • Authors:

  • Eric Allender;Michal Koucký;Detlef Ronneburger;Sambudda Roy;V. Vinay

  • Affiliations:

  • -;-;-;-;-

  • Venue:
  • CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Abstract: We extend the lower bound techniques of [14], to the unbounded-error probabilistic model. A key step in the argument is a generalization of Nepomnjascii's theorem from the Boolean setting to the arithmetic setting. This generalization is made possible, due to the recent discovery of logspace-uniform TC0 circuits for iterated multiplication [9]. Here is an example of the sort of lower bounds that we obtain: we show that MAJ·MAJSAT is not contained in PrTiSp(n{1+o(1), n\epsilon) for any \epsilon