TY - JOUR A1 - Brosenne, Henrik A1 - Damm, Carsten A1 - Homeister, Matthias A1 - Waack, Stephan T1 - On approximation by ⊕-OBDDs JF - Information Processing Letters KW - Computational complexity KW - Nondeterministic OBDD KW - Parity OBDD KW - Approximation Y1 - 2007 U6 - https://doi.org/10.1016/j.ipl.2006.10.011 SN - 1872-6119 (Online) SN - 0020-0190 (Print) VL - 102 IS - 1 SP - 17 EP - 21 ER - TY - JOUR A1 - Brosenne, Henrik A1 - Homeister, Matthias A1 - Waack, Stephan T1 - Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs JF - RAIRO - Theoretical Informatics and Applications (ITA) KW - Well-structured graph-driven parity-FBDDs KW - lower bounds KW - minimization algorithm KW - complexity theory KW - data structures for Boolean functions Y1 - 2002 U6 - https://doi.org/10.1051/ita:2002011 SN - 1290-385X (Online) SN - 0988-3754 (Print) VL - 36 IS - 3 SP - 229 EP - 247 ER - TY - JOUR A1 - Brosenne, Henrik A1 - Homeister, Matthias A1 - Waack, Stephan T1 - Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance JF - Information Processing Letters KW - Computational complexity KW - Theory of computation KW - Branching programs KW - Ordered binary decision diagrams with repeated tests KW - Existential, universal, parity, and majority acceptance mode Y1 - 2006 U6 - https://doi.org/10.1016/j.ipl.2005.11.011 SN - 1872-6119 (Online) SN - 0020-0190 (Print) VL - 98 IS - 1 SP - 6 EP - 10 ER -