Restricted branching programs are considered in complexity theory in order to study the space complexity of sequential computations and in applications as a data structure for Boolean functions. Inâ€¦ (More)

Decision diagrams (DDs) are the state-of-the-art data structure in VLSI CAD and have been successfully applied in many other fields. DDs are widely used and are also integrated in commercial tools.â€¦ (More)

Decision trees are representations of discrete functions with widespread applications in, e.g., complexity theory and data mining and exploration. In these areas it is important to obtain decisionâ€¦ (More)

Abstract The size of Ordered Binary Decision Diagrams (OBDDs) is determined by the chosen variable ordering. A poor choice may cause an OBDD to be too large to fit into the available memory. Theâ€¦ (More)

In this paper, the space complexity of nonuniform quantum algorithms is investigated using the model of quantum branching programs (QBPs). In order to clarify the relationship between QBPs andâ€¦ (More)

Å½ . ABSTRACT: The size of ordered binary decision diagrams OBDDs strongly depends on the chosen variable ordering. It is an obvious heuristic to use symmetric variable orderings, i.e., variableâ€¦ (More)