TY - CHAP A1 - Brosenne, Henrik A1 - Homeister, Matthias A1 - Waack, Stephan ED - Sgall, Jiří T1 - Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds T2 - Mathematical foundations of computer science 2001 : 26th international symposium ; proceedings / MFCS 2001, Mariánské Lázně, Czech Republic, August 27 - 31, 2001 T3 - Lecture notes in computer science - 2136 Y1 - 2001 SN - 978-3-540-44683-5 (Online) U6 - https://doi.org/10.1007/3-540-44683-4_19 SP - 212 EP - 223 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Brosenne, Henrik A1 - Homeister, Matthias A1 - Waack, Stephan ED - Rovan, Branislav T1 - Lower Bounds for General Graph–Driven Read–Once Parity Branching Programs T2 - Mathematical foundations of computer science 2003 : 28th international symposium ; proceedings / MFCS 2003, Bratislava, Slovakia, August 25 - 29, 2003 T3 - Lecture notes in computer science - 2747 Y1 - 2003 SN - 978-3-540-40671-6 (Print) SN - 978-3-540-45138-9 (Online) U6 - https://doi.org/10.1007/978-3-540-45138-9_23 SP - 290 EP - 299 PB - Springer CY - Berlin ; Heidelberg ER -