Extension of the hierarchy for k-OBDDs of small width

Extension of the hierarchy for k-OBDDs of small width

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Russian mathematics 2013-03, Vol.57 (3), p.46-50
Hauptverfasser: Ablayev, F. M., Khadiev, K. R.
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics
Mathematics and Statistics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1066-369X
1934-810X
DOI:10.3103/S1066369X13030067