RANDOM POLYNOMIAL TIME IS EQUAL TO SLIGHTLY-RANDOM POLYNOMIAL TIME.

Abstract

Random polynomial time (R//P) is currently considered to be the class of tractable computational problems. Here one assumes a source of truly random bits. However, the known sources of randomness are imperfect. They can be modeled as an adversary source, called slightly-random source. Slightly-random polynomial time (SR//P) is the class of problems solvable in polynomial time using such a source. SR//P is thus a more realistic definition of a tractable computational problem. The author shows that R//P equals SR//P. The proof method is constructive: given an R//P algorithm for a problem, it is shown how to obtain an SR//P algorithm for it.