A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
[chapter]
2002
Lecture Notes in Computer Science
We present a new lower bound technique for a restricted Branching Program model, namely for nondeterministic graph-driven read-once Branching Programs (g.d.-BP1s). The technique is derived by drawing a connection between ω-nondeterministic g.d.-BP1s and ωnondeterministic communication complexity (for the nondeterministic acceptance modes ω ∈ {∨, ∧, ⊕}). We apply the technique in order to prove an exponential lower bound for integer multiplication for ωnondeterministic well-structured g.d.-BP1s.
doi:10.1007/3-540-45687-2_10
fatcat:ehj7iq2iy5euhe66rk2xvf4zz4