Typically-Correct Derandomization for Small Time and Space

11/01/2017
by   William M. Hoza, et al.
0

Suppose a language L can be decided by a bounded-error randomized algorithm that runs in space S and time n ·poly(S). We give a randomized algorithm for L that still runs in space O(S) and time n ·poly(S) that uses only O(S) random bits; our algorithm has a low failure probability on all but a negligible fraction of inputs of each length. An immediate corollary is a deterministic algorithm for L that runs in space O(S) and succeeds on all but a negligible fraction of inputs of each length. Next, suppose a language L can be decided by a nondeterministic algorithm that runs in space S and time n ·poly(S). We give an unambiguous algorithm for L that runs in space O(S √( S)) and time 2^O(S) that succeeds on all but a negligible fraction of inputs of each length. Finally, we prove that BPL⊆L/(n + O(^2 n)) and NL⊆UL/(n + O(^2 n)), improving results by Fortnow and Klivans (STACS '06) and Reinhardt and Allender (SICOMP '00), respectively. If the original randomized/nondeterministic algorithm runs in quasilinear time, we show that fewer than n bits of advice suffice (for disambiguation, this involves increasing the space complexity to O( n √( n))).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2020

Longest Common Subsequence in Sublinear Space

We present the first o(n)-space polynomial-time algorithm for computing ...
research
11/02/2021

Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions

We consider low-space algorithms for the classic Element Distinctness pr...
research
10/14/2022

Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness

In the Element Distinctness problem, one is given an array a_1,…, a_n of...
research
01/30/2019

Computing runs on a trie

A maximal repeat, or run, in a string, is a periodically maximal substri...
research
08/05/2021

Efficient CONGEST Algorithms for the Lovasz Local Lemma

We present a poly loglog n time randomized CONGEST algorithm for a natur...
research
12/06/2019

Constructive derandomization of query algorithms

We give efficient deterministic algorithms for converting randomized que...
research
01/12/2022

Biochemical Space Language in Relation to Multiset Rewriting Systems

This technical report relates Biochemical Space Language (BCSL) to Multi...

Please sign up or login with your details

Forgot password? Click here to reset