A new general derandomization method.

We show that quick hitting set generators can replace quick pseudorandom generators to derandomize any probabilistic two-sided error algorithms. Up to now quick hitting set generators have been known as the general and uniform derandomization method for probabilistic one-sided error algorithms, whil...

詳細記述

書誌詳細

出版年:	Journal of the ACM 45, 1 (1998).
第一著者:	Andreev, Alexander E.
フォーマット:	論文
言語:	English
主題:	Theory of computation. Analysis of algorithms and problem complexity. Nonnumerical algorithms and problems. Computations on discrete structures. Mathematics of computing. Probability and statistics. Probabilistic algorithms (including Monte Carlo). Algorithms. Theory.