paper

Width Hierarchy for k-OBDD of Small Width

arXiv:1502.04226 · doi:10.1134/S1995080215020092

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.

arXiv comment8 pages

Cited by in corpus (3)