Russian Mathematics

, Volume 57, Issue 3, pp 46–50 | Cite as

Extension of the hierarchy for k-OBDDs of small width

  • F. M. Ablayev
  • K. R. Khadiev


In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an “automata-communication protocol” computation process. Our method allows us to extend the hierarchy proved by Bolling-Sauerhoff-Sieling-Wegener in 1996 for k-OBDDs. Moreover, using the PJM function (a modification of well-known PJ and ISA functions), we prove a new hierarchy.

Keywords and phrases

branching programs binary decision diagrams OBDD k-OBDD communication protocol communication complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    I. Wegener, Branching Programs and Binary Decision Diagrams: Theory and Applications (Society for Industrial and Applied Mathematics, Philadelphia, 2000).zbMATHCrossRefGoogle Scholar
  2. 2.
    B. Bolling, M. Sauerhoff, D. Sieling, and I. Wegener, “Hierarchy Theorems for kOBDDs and kIBDDs,” Theoretical Computer Science 205(1–2), 45–60, 1998.MathSciNetCrossRefGoogle Scholar
  3. 3.
    N. Nisan and A. Widgerson, “Rounds In Communication Complexity Revisited,” SIAM Journal on Computing 22(1), 211–219, 1993.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Allerton Press, Inc. 2013

Authors and Affiliations

  1. 1.Kazan (Volga Region) Federal UniversityKazanRussia

Personalised recommendations