Work

Width hierarchy for k-OBDD of small width

Year: 2015

Type: article

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.

Source: Lobachevskii Journal of Mathematics

DOI: 10.1134/s1995080215020092

Author: K. Khadiev

Institution: Kazan Federal University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Russian Foundation for Basic Research, Kazan Federal University

OpenAlex ID: W2155822409

FWCI: 2.43

Cites: 13

Cited by: 11

Related to: 10