Extension of the hierarchy for k-OBDDs of small width
- 48 Downloads
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 phrasesbranching programs binary decision diagrams OBDD k-OBDD communication protocol communication complexity
Unable to display preview. Download preview PDF.