BOUNDS FOR WIDTH TWO BRANCHING PROGRAMS.

Allan Borodin; Danny Dolev; Faith E. Fich; Wolfgang Paul

doi:10.1137/0215040

BOUNDS FOR WIDTH TWO BRANCHING PROGRAMS.

Allan Borodin^*, Danny Dolev, Faith E. Fich, Wolfgang Paul

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

19 Scopus citations

Abstract

Branching programs have been studied as a fundamental model for space bounded computations and, in particular, as a model in which to try to establish nontrivial space lower bounds and time-space trade-offs. At present, there still do not exist any results for single output functions. We consider a class of severely constrained programs (those having width 2) and establish characterizations as well as lower bounds for some Boolean functions computable within this model.

Original language	English
Pages (from-to)	549-560
Number of pages	12
Journal	SIAM Journal on Computing
Volume	15
Issue number	2
DOIs	https://doi.org/10.1137/0215040
State	Published - 1986
Externally published	Yes

Access to Document

10.1137/0215040

Cite this

@article{87a891d73eba4849b04f1f6136d75bad,

title = "BOUNDS FOR WIDTH TWO BRANCHING PROGRAMS.",

abstract = "Branching programs have been studied as a fundamental model for space bounded computations and, in particular, as a model in which to try to establish nontrivial space lower bounds and time-space trade-offs. At present, there still do not exist any results for single output functions. We consider a class of severely constrained programs (those having width 2) and establish characterizations as well as lower bounds for some Boolean functions computable within this model.",

author = "Allan Borodin and Danny Dolev and Fich, {Faith E.} and Wolfgang Paul",

year = "1986",

doi = "10.1137/0215040",

language = "אנגלית",

volume = "15",

pages = "549--560",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - BOUNDS FOR WIDTH TWO BRANCHING PROGRAMS.

AU - Borodin, Allan

AU - Dolev, Danny

AU - Fich, Faith E.

AU - Paul, Wolfgang

PY - 1986

Y1 - 1986

N2 - Branching programs have been studied as a fundamental model for space bounded computations and, in particular, as a model in which to try to establish nontrivial space lower bounds and time-space trade-offs. At present, there still do not exist any results for single output functions. We consider a class of severely constrained programs (those having width 2) and establish characterizations as well as lower bounds for some Boolean functions computable within this model.

AB - Branching programs have been studied as a fundamental model for space bounded computations and, in particular, as a model in which to try to establish nontrivial space lower bounds and time-space trade-offs. At present, there still do not exist any results for single output functions. We consider a class of severely constrained programs (those having width 2) and establish characterizations as well as lower bounds for some Boolean functions computable within this model.

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

U2 - 10.1137/0215040

DO - 10.1137/0215040

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0022712784

SN - 0097-5397

VL - 15

SP - 549

EP - 560

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

BOUNDS FOR WIDTH TWO BRANCHING PROGRAMS.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this