Width Hierarchy for k-OBDD of Small Width
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2015
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914740082573312 |
|---|---|
| author | Khadiev, Kamil |
| author_facet | Khadiev, Kamil |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1502_04226 |
| institution | arXiv |
| publishDate | 2015 |
| record_format | arxiv |
| spellingShingle | Width Hierarchy for k-OBDD of Small Width Khadiev, Kamil Computational Complexity 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. |
| title | Width Hierarchy for k-OBDD of Small Width |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/1502.04226 |