Error-free affine, unitary, and probabilistic OBDDs
From MaRDI portal
(Redirected from Publication:778003)
Abstract: We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results by considering the automata versions of these models.
Recommendations
Cited in
(11)- Improved constructions for succinct affine automata
- Exact affine counter automata
- Exact Affine Counter Automata
- Error-Free Affine, Unitary, and Probabilistic OBDDs
- Computational limitations of affine automata and generalized affine automata
- Quantum online streaming algorithms with logarithmic memory
- Nondeterministic unitary OBDDs
- Quantum algorithm for dynamic programming approach for DAGs and applications
- Quantum online algorithms with respect to space and advice complexity
- Affine automata verifiers
- Deterministic construction of QFAs based on the quantum fingerprinting technique
This page was built for publication: Error-free affine, unitary, and probabilistic OBDDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778003)