Publications
Article · Lobachevskii Journal of Mathematics · April 1, 2015
Width hierarchy for k-OBDD of small width
Abstract
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.
Complexity and Algorithms in Graphssemigroups and automata theoryAdvanced Graph Theory Researchbinary decision diagramsBoolean functionscircuit complexity
More by Kamil Khadiev
- Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering PatharXiv · 2026
- Quantum k-means based on Quantum Local Sensitive Hashing with Application to Irrigation Machine Sensors Data ClusteringIEEE International Conference on Smart Computing Workshops and Other Affiliated Events · 2026
- Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity GrapharXiv · 2026
- Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs Based on 1-Cover PathInternational Conference on Quantum Communications, Networking, and Computing · 2026 · Citations: 1