“…One can have similar branching programs for the parity function. It can be shown that every function on n bits can be computed by a branching program of width 3 and exponential length" (Hunsperger, 2002;Hussein, Nounou, Saada, Atef, & Khalil, 2006;Jang, Park, & Prasanna, 1992;Taki, 2000;Lattner, 2002;Mehlhorn & Nher, 1995;Moreinis, Morgenshtein, Wagner, & Kolodny, 2006;Morgenshtein, Fish, & Wagner, 2002;Morgenshtein, Friedman, Ginosar, & Kolodny, 2008;Nakano & Wada, 1998;Nishihara, Haruna, & Suhara, 1987;Okayama, Okabe, Kamijoh, & Sakamoto, 1999;Reed & Knights, 2004;Shi, Wa, Miller, Pamulapati, & Cooke, 1995;Isabelle, 2012;Anthony Fox, 2012; HOL: The Higher Order Logic Theorem Prover; Barrington's Theorem, 2009). Figure 1, we designed a simple boolean circuit and deduced its equivalent branching program, using the established mathematical and computational paradigms.…”