ECCC-Report TR98-053https://eccc.weizmann.ac.il/report/1998/053Comments and Revisions published for TR98-053en-usThu, 17 Sep 1998 14:34:05 +0200
Comment 1
| Corrected Version: Time-Space Tradeoffs for Branching Programs Comment on: TR98-053 |
Paul Beame,
Michael Saks,
Jayram S. Thathachar
https://eccc.weizmann.ac.il/report/1998/053#comment1Thu, 17 Sep 1998 14:34:05 +0200https://eccc.weizmann.ac.il/report/1998/053#comment1
Paper TR98-053
| Time-Space Tradeoffs for Branching Programs |
Paul Beame,
Michael Saks,
Jayram S. Thathachar
https://eccc.weizmann.ac.il/report/1998/053We obtain the first non-trivial time-space tradeoff lower bound for
functions f:{0,1}^n ->{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 cn, for some constant c>1. We also give the first
separation result between the syntactic and semantic read-k models for k>1 by
showing that polynomial-size semantic read-twice branching programs can compute
functions that require exponential size on any syntactic read-k branching
program. We also show a time-space tradeoff result on the more general
R-way branching program model: 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).
Mon, 31 Aug 1998 16:58:51 +0300https://eccc.weizmann.ac.il/report/1998/053