TY - JOUR A1 - Homeister, Matthias T1 - Lower bounds for restricted read-once parity branching programs JF - Theoretical Computer Science KW - Read-once parity branching programs KW - Lower bounds KW - Computational complexity Y1 - 2006 U6 - https://doi.org/10.1016/j.tcs.2006.01.052 SN - 0304-3975; 1879-2294 VL - 359 IS - 1-3 SP - 1 EP - 14 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 -