Width Hierarchy for $k$-OBDD of Small Width

Kamil Khadiev

Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Revision(s):

Revision #1 to TR15-048 | 7th April 2015 22:35

Width Hierarchy for $k$-OBDD of Small Width

Revision #1 Authors: Kamil Khadiev
Accepted on: 7th April 2015 22:35
Downloads: 1194

Keywords:

branching program, hierarchy, k-OBDD, OBDD

Abstract:

In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function's non representation as k-OBDD and complexity properties of Boolean
function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (ISA) functions.

Changes to previous version:

Illustration was added.

Paper:

TR15-048 | 14th February 2015 17:45

Width Hierarchy for $k$-OBDD of Small Width

TR15-048 Authors: Kamil Khadiev
Publication: 3rd April 2015 23:00
Downloads: 1462

Keywords:

binary decision diagrams, branching programs, Complexity classes, k-OBDD, OBDD

Abstract:

In this paper was explored well known model $k$-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by $k$-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function's non representation as $k$-OBDD and complexity properties of Boolean
function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (ISA) functions.

ISSN 1433-8092 | Imprint