Bounded Width Branching Programs
| dc.contributor.advisor | Sipser, Michael | en_US |
| dc.contributor.author | Barrington, David A. | en_US |
| dc.date.accessioned | 2023-03-29T15:13:22Z | |
| dc.date.available | 2023-03-29T15:13:22Z | |
| dc.date.issued | 1986-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149629 | |
| dc.description.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]. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-361 | |
| dc.title | Bounded Width Branching Programs | en_US |
| dc.identifier.oclc | 16963185 |
