Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test
Year: 2017
Type: preprint
Abstract: We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read-$k$-times Branching Programs or Ordered Binary Decision Diagrams with repeated test ($k$-QOBDD, $k$-NOBDD and $k$-POBDD). We show width hierarchy for complexity classes of Boolean function computed by these models and discuss relation between different variants of $k$-OBDD.
Source: arXiv (Cornell University)
Authors: Khadiev, Kamil, Ibrahimov, Rishat
Institutions: Kazan Federal University, University of Latvia
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Kazan Federal University
OpenAlex ID: W2604712659