Results 51 to 60 of about 3,866,349 (62)
On the descriptive and algorithmic power of parity ordered binary decision diagrams
Lecture Notes in Computer Science, 1997 We present a data structure for Boolean functions, which we call Parity--OBDDs or \Phi-- OBDDs, which combines the nice algorithmic properties of the well--known ordered binary decision diagrams (OBDDs) with a considerably larger descriptive power ...
Stephan Waack
exaly +1 more source
Some of the next articles are maybe not open access.
Proceedings of EURO-DAC. European Design Automation Conference, 2002
Theodore Karoubalis +2 more
openaire +2 more sources
Theodore Karoubalis +2 more
openaire +2 more sources
OBDD-NET: End-to-End Learning of Ordered Binary Decision Diagrams
Proceedings of the 34th ACM International Conference on Information and Knowledge ManagementJunming Qiu +5 more
openaire +2 more sources
Reasoning with ordered binary decision diagrams
Discrete Applied Mathematics, 2004Takashi Horiyama, Toshihide Ibaraki
exaly
Optimal ordered binary decision diagrams for read-once formulas
Discrete Applied Mathematics, 2000Ingo Wegener, Martin Sauerhoff
exaly
Translation among CNFs, characteristic models and ordered binary decision diagrams
Information Processing Letters, 2003Takashi Horiyama, Toshihide Ibaraki
exaly
Comparative complexity of quantum and classical OBDDs for total and partial functions
Russian Mathematics, 2015Aida Gainutdinova
exaly
On the error resilience of ordered binary decision diagrams
Theoretical Computer Science, 2015Valentina Ciriani, Anna Bernasconi
exaly