Running summarizing tools on a new article
Check the paper below, then start its synthesis.
Deterministic simulation in LOGSPACE
Miklós Ajtai (IBM (United States), IBM Research - Almaden), János Komlós (University of California San Diego), Endre Szemerédi (Rutgers, The State University of New Jersey)
Abstract: In this paper we show that a wide class of probabilistic algorithms can be simulated by deterministic algorithms. Namely if there is a test in LOGSPACE so that a random sequence of length (log n)2 / log log n passes the test with probability at least 1/n then a deterministic sequence can be constructed in LOGSPACE which also passes the test. It is important that the machine performing the test gets each bit of the sequence only once. The theorem remains valid if both the test and the machine constructing the satisfying sequence have access to the same oracle of polynomial size.