Width hierarchy for k-OBDD of small width© 2015, Pleiades Publishing, Ltd. In this paper was explored well known model k-
OBDD Error-free affine, unitary, and probabilistic OBDDS© IFIP International Federation for Information Processing 2018. We introduce the affine
OBDD model
Reordering method and hierarchies for quantum and classical ordered binary decision diagrams© Springer International Publishing AG 2017.We consider Quantum
OBDD model. It is restricted
Very narrow quantum OBDDs and width hierarchies for classical OBDDs (
OBDDs)–a model for computing Boolean functions. We present a series of results on the comparative
Extension of the hierarchy for k-OBDDs of small widthIn this paper we explore the well-known k-
OBDD model of branching programs. We develop a method
Width hierarchy for k-OBDD of small width© 2015, Pleiades Publishing, Ltd. In this paper was explored well known model k-
OBDD Comparative complexity of quantum and classical OBDDs for total and partial functions—Ordered Binary Decision Diagrams (
OBDD).We investigate comparative complexity of quantum, deterministic
Very narrow quantum OBDDs and width hierarchies for classical OBDDs (
OBDDs)–a model for computing Boolean functions. We present a series of results on the comparative
Extension of the hierarchy for k-OBDDs of small widthIn this paper we explore the well-known k-
OBDD model of branching programs. We develop a method
Comparative complexity of quantum and classical OBDDs for total and partial functions—Ordered Binary Decision Diagrams (
OBDD).We investigate comparative complexity of quantum, deterministic