Bounded Width Branching Programs
Name
MIT-LCS-TR-361.pdf
Size
1.54 MB
Format
Adobe PDF
Checksum (MD5)
1312e0d6bf5fef367b1df01afcf8c823
Author(s)
Barrington, David A.
Advisor(s)
Sipser, Michael
Date Issued
June 1986
Series/Report no.
MIT-LCS-TR-361
Abstract
We examine the branching program model of computation and in particular the classes of languages which can be recognized when the width of the programs is bounded by a constant. After slightly revising the framework of definitions to sharpen analogies with other models, we prove that width 5 polynomial size branching programs can recognize exactly the parallel complexity class NC1, refuting a conjecture of Borodin et al. in [BDFP83].
Persistent DSpace Link
