Time-space tradeoffs for branching programs

Paul Beame, Michael Saks, Jayram S. Thathachar

Research output: Contribution to journalConference article

29 Citations (Scopus)

Abstract

We 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 (1+ε)n, for some constant ε>0. 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 call 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).

Original languageEnglish (US)
Pages (from-to)254-263
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - Dec 1 1998
Externally publishedYes
EventProceedings of the 1998 39th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA
Duration: Nov 8 1998Nov 11 1998

Fingerprint

Syntactics
Semantics
Boolean functions
Polynomials

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

@article{2595470fcba54cfe83099dc9ba4eca4e,
title = "Time-space tradeoffs for branching programs",
abstract = "We 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 (1+ε)n, for some constant ε>0. 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 call 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).",
author = "Paul Beame and Michael Saks and Thathachar, {Jayram S.}",
year = "1998",
month = "12",
day = "1",
language = "English (US)",
pages = "254--263",
journal = "Annual Symposium on Foundations of Computer Science - Proceedings",
issn = "0272-5428",

}

Time-space tradeoffs for branching programs. / Beame, Paul; Saks, Michael; Thathachar, Jayram S.

In: Annual Symposium on Foundations of Computer Science - Proceedings, 01.12.1998, p. 254-263.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Time-space tradeoffs for branching programs

AU - Beame, Paul

AU - Saks, Michael

AU - Thathachar, Jayram S.

PY - 1998/12/1

Y1 - 1998/12/1

N2 - We 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 (1+ε)n, for some constant ε>0. 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 call 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).

AB - We 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 (1+ε)n, for some constant ε>0. 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 call 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).

UR - http://www.scopus.com/inward/record.url?scp=0032311620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032311620&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0032311620

SP - 254

EP - 263

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

SN - 0272-5428

ER -