Error-free affine, unitary, and probabilistic OBDDs

From MaRDI portal
Publication:778003

DOI10.1007/978-3-319-94631-3_15zbMATH Open1435.68072arXiv1703.07184OpenAlexW2878465808MaRDI QIDQ778003FDOQ778003


Authors: Rishat Ibrahimov, Kamil Khadiev, Krišjānis Prūsis, Abuzer Yakaryılmaz Edit this on Wikidata


Publication date: 30 June 2020

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.


Full work available at URL: https://arxiv.org/abs/1703.07184




Recommendations





Cited In (11)





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)