Henrik Brosenne, Matthias Homeister, Stephan Waack. Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. In Branislav Rovan, Peter Vojtás, editors, Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings. Volume 2747 of Lecture Notes in Computer Science, pages 290-299, Springer, 2003. [doi]
Abstract is missing.