Add to ORKG© 2015, Pleiades Publishing, Ltd. 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
AbstractInteger multiplication as one of the basic arithmetic functions has been in the focus of sev...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
Boolean function manipulation is an important component of computer science. This thesis presents r...
© 2015, Pleiades Publishing, Ltd. In this paper was explored well known model k-OBDD. There are prov...
In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of r...
In the paper we investigate a model for computing of Boolean functions - Ordered Binary Decision Dia...
AbstractWe consider the size of the representation of Boolean functions by several classes of binary...
© Springer International Publishing AG 2017.We consider Quantum OBDD model. It is restricted version...
AbstractAlmost the same types of restricted branching programs (or binary decision diagrams BDDs) ar...
© 2016, Pleiades Publishing, Ltd.The paper examines hierarchies for nondeterministic and determinist...
[[abstract]]The behavior of ordered binary decision diagrams (OBDD) for general Boolean functions is...
Abstract. Ordered binary decision diagrams (OBDDs) are nowadays the most common dynamic data structu...
AbstractInteger multiplication as one of the basic arithmetic functions has been in the focus of sev...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
Boolean function manipulation is an important component of computer science. This thesis presents r...
© 2015, Pleiades Publishing, Ltd. In this paper was explored well known model k-OBDD. There are prov...
In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of r...
In the paper we investigate a model for computing of Boolean functions - Ordered Binary Decision Dia...
AbstractWe consider the size of the representation of Boolean functions by several classes of binary...
© Springer International Publishing AG 2017.We consider Quantum OBDD model. It is restricted version...
AbstractAlmost the same types of restricted branching programs (or binary decision diagrams BDDs) ar...
© 2016, Pleiades Publishing, Ltd.The paper examines hierarchies for nondeterministic and determinist...
[[abstract]]The behavior of ordered binary decision diagrams (OBDD) for general Boolean functions is...
Abstract. Ordered binary decision diagrams (OBDDs) are nowadays the most common dynamic data structu...
AbstractInteger multiplication as one of the basic arithmetic functions has been in the focus of sev...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
Boolean function manipulation is an important component of computer science. This thesis presents r...