Author:
Balaji Nikhil,Krebs Andreas,Limaye Nutan
Publisher
Springer International Publishing
Reference11 articles.
1. Barrington, D.A.: Width-3 permutation branching programs. Technical Memo MIT/LCS/TM-293, Massachusetts Institute of Technology, Laboratory for Computer Science (1985)
2. Barrington, D.A.: Bounded-width polynomial-size branching programs can recognize exactly those languages in
$$NC^1$$
N
C
1
. Journal of Computer and System Sciences 38, 150–164 (1989)
3. Borodin, A., Dolev, D., Fich, F.E., Paul, W.: Bounds for width two branching programs. SIAM Journal on Computing 15(2), 549–560 (1986)
4. Brodsky, A.: An impossibility gap between width-4 and width-5 permutation branching programs. Information Processing Letters 94(4), 159–164 (2005)
5. Herstein, I.N.: Topics in algebra. John Wiley & Sons (2006)