Abstract
In this work, we study the power of bounded width branching programs by comparing them with bounded width skew circuits.
It is well known that branching programs of bounded width have the same power as skew circuit of bounded width. The naive approach converts a BP of width w to a skew circuit of width \(w^2\). We improve this bound and show that BP of width \(w \ge 5\) can be converted to a skew circuit of width 7. This also implies that skew circuits of bounded width are equal in power to skew circuits of width 7. For the other way, we prove that for any \(w \ge 2\), a skew circuit of width w can be converted into an equivalent branching program of width w. We prove that width-2 skew circuits are not universal while width-3 skew circuits are universal and that any polynomial sized CNF or DNF is computable by width 3 skew circuits of polynomial size.
We prove that a width-3 skew circuit computing Parity requires exponential size. This gives an exponential separation between the power of width-3 skew circuits and width-4 skew circuits.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barrington, D.A.: Width-3 permutation branching programs. Technical Memo MIT/LCS/TM-293, Massachusetts Institute of Technology, Laboratory for Computer Science (1985)
Barrington, D.A.: Bounded-width polynomial-size branching programs can recognize exactly those languages in \(NC^1\). Journal of Computer and System Sciences 38, 150–164 (1989)
Borodin, A., Dolev, D., Fich, F.E., Paul, W.: Bounds for width two branching programs. SIAM Journal on Computing 15(2), 549–560 (1986)
Brodsky, A.: An impossibility gap between width-4 and width-5 permutation branching programs. Information Processing Letters 94(4), 159–164 (2005)
Herstein, I.N.: Topics in algebra. John Wiley & Sons (2006)
Lee, C.-Y.: Representation of switching circuits by binary-decision programs. Bell System Technical Journal 38(4), 985–999 (1959)
Masek, W.J.: A fast algorithm for the string editing problem and decision graph complexity. PhD thesis, Massachusetts Institute of Technology (1976)
Razborov, A.A.: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mathematical Notes 41(4), 333–338 (1987)
Rao, B.V.R.: A study of width bounded arithmetic circuits and the complexity of matroid isomorphism. [HBNI TH 17] (2010)
Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 77–82. ACM (1987)
Viola, E.: On approximate majority and probabilistic time. Computational Complexity 18(3), 337–375 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Balaji, N., Krebs, A., Limaye, N. (2015). Skew Circuits of Small Width. In: Xu, D., Du, D., Du, D. (eds) Computing and Combinatorics. COCOON 2015. Lecture Notes in Computer Science(), vol 9198. Springer, Cham. https://doi.org/10.1007/978-3-319-21398-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-21398-9_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21397-2
Online ISBN: 978-3-319-21398-9
eBook Packages: Computer ScienceComputer Science (R0)