Aida Gainutdinova

On the Complexity of Computing the Shuffled Inequality Function in Classical and Quantum NOBDDs

2025 · Russian Mathematics

Abstract We investigate ordered binary decision diagrams (OBDDs)—a model for computing Boolean functions. It is known that OBDD’s complexity can extremely depend on the order of reading variables. There are techniques for constructing functions that …