Error-free affine, unitary, and probabilistic OBDDs
From MaRDI portal
Publication:778003
DOI10.1007/978-3-319-94631-3_15zbMath1435.68072arXiv1703.07184OpenAlexW2878465808MaRDI QIDQ778003
Krišjānis Prūsis, Abuzer Yakaryılmaz, Kamil Khadiev, Rishat Ibrahimov
Publication date: 30 June 2020
Full work available at URL: https://arxiv.org/abs/1703.07184
quantum computationOBDDssuccinctnessaffine modelsprobabilistic computationLas Vegas computationzero-error
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (10)
Affine automata verifiers ⋮ Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ Computational limitations of affine automata and generalized affine automata ⋮ Exact Affine Counter Automata ⋮ Error-Free Affine, Unitary, and Probabilistic OBDDs ⋮ Unnamed Item ⋮ Quantum online algorithms with respect to space and advice complexity ⋮ Quantum online streaming algorithms with logarithmic memory ⋮ Improved constructions for succinct affine automata
This page was built for publication: Error-free affine, unitary, and probabilistic OBDDs
