Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs.

Henrik Brosenne, Matthias Homeister, Stephan Waack

Browse the full MFCS paper archive.