BibTeX
@MISC{Beame99ontime–space,
author = {Paul Beame and T. S. Jayram and Michael Saks},
title = {on Time–Space Tradeoffs for Branching},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We obtain the first non-trivial time–space tradeoff lower bound for func-tions f: {0, 1}nQ {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1+e) n, for some constant e> 0. We also give the first separation result between the syntactic and semantic read-k models (A. Borodin et al., Comput. Complexity 3 (1993), 1–18) for k> 1 by showing that polynomial-size semantic read-twice branching programs can compute functions that require exponential size on any semantic read-k branching program. We also show a time–space tradeoff result on the more general R-way branching program model (Borodin et al., 1993): for any k, we give a function that requires exponential size to be computed by length kn q-way branching programs, for some q=q(k). This result gives a similar tradeoff for RAMs, and thus provides the first nontrivial time–space tradedoff for decision problems in this model. © 2001 Elsevier Science (USA) 1.
Keyphrases
exponential size time space tradeoff time space tradeoff result semantic read-k model polynomial-size semantic read-twice branching program first non-trivial time space tradeoff semantic read-k branching program decision problem similar tradeoff branching program general r-way branching program model boolean function length kn elsevier science general branching program first separation result first nontrivial time space tradedoff
