Abstract
The parallel complexity class NC1 has many equivalent models such as bounded width branching programs. Caussinus et.al[10] considered arithmetizations of two of these classes, #NC1 and #BWBP. We further this study to include arithmetization of other classes. In particular, we show that counting paths in branching programs over visibly pushdown automata has the same power as #BWBP, while counting proof-trees in logarithmic width formulae has the same power as #NC1. We also consider polynomial-degree restrictions of SCi, denoted sSCi, and show that the Boolean class sSC1 lies between NC1 and L, whereas sSC0 equals NC1. On the other hand, #sSC0 contains #BWBP and is contained in FL, and #sSC1 contains #NC1 and is in SC2. We also investigate some closure properties of the newly defined arithmetic classes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
