Width Hierarchy for k-OBDD of Small Width
Computational Complexity
2024-04-05 v2
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.
Cite
@article{arxiv.1502.04226,
title = {Width Hierarchy for k-OBDD of Small Width},
author = {Kamil Khadiev},
journal= {arXiv preprint arXiv:1502.04226},
year = {2024}
}
Comments
8 pages