Classical and quantum computations with restricted memory
Abstract Automata and branching programs are known models of computation with restricted
memory. These models of computation were in focus of a large number of researchers …
memory. These models of computation were in focus of a large number of researchers …
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
In the paper we investigate Ordered Binary Decision Diagrams (OBDDs)–a model for
computing Boolean functions. We present a series of results on the comparative complexity …
computing Boolean functions. We present a series of results on the comparative complexity …
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
In the paper we investigate a model for computing of Boolean functions–Ordered Binary
Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We …
Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We …
Error-free affine, unitary, and probabilistic OBDDs
We introduce the affine OBDD model and show that zero-error affine OBDDs can be
exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain …
exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain …
[PDF][PDF] On the complexity of the hidden weighted bit function for various BDD models
B Bollig, M Löbbing, M Sauerhoff… - … -Informatique Théorique et …, 1999 - numdam.org
Ordered binary décision diagrams (OBDDs) and several more gênerai BDD models have
turned out to be représentations of Boolean functions which are useful in applications like …
turned out to be représentations of Boolean functions which are useful in applications like …
[PDF][PDF] On separating the read-k-times branching program hierarchy
JS Thathachar - Proceedings of the thirtieth annual ACM symposium on …, 1998 - dl.acm.org
WC obtain an exponential separation between consecutive levels in the hierarchy of classes
of functions computable by syntactic read-k-times branching programs of polynomial size, for …
of functions computable by syntactic read-k-times branching programs of polynomial size, for …
On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
K Khadiev - Lobachevskii Journal of Mathematics, 2016 - Springer
The paper examines hierarchies for nondeterministic and deterministic ordered read-ktimes
Branching programs. The currently known hierarchies for deterministic k-OBDD models of …
Branching programs. The currently known hierarchies for deterministic k-OBDD models of …
[BOOK][B] The computational complexity of equivalence and isomorphism problems
T Thierauf - 2000 - Springer
Untitled Page 1 Page 2 66 Chapter 4. Branching Programs L/poly is the nonuniform version of
L: for every input length we have a polynomial advice for free. Formally, L ∈ L/poly if there …
L: for every input length we have a polynomial advice for free. Formally, L ∈ L/poly if there …
Width hierarchy for k-OBDD of small width
K Khadiev - Lobachevskii Journal of Mathematics, 2015 - Springer
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 of classes of boolean functions which computed by k-OBDD. The proof of …
Error-free affine, unitary, and probabilistic OBDDs
We introduce the affine OBDD model and show that zero-error affine OBDDs can be
exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain …
exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain …