Special Section on Discrete Mathematics and Its Applications
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability
2016 Volume E99.A Issue 6 Pages 1019-1024
Details
2016 Volume E99.A Issue 6 Pages 1019-1024
We propose an exact algorithm to determine the satisfiability of oblivious read-twice branching programs. Our algorithm runs in $2^{\left(1 - \Omega(\frac{1}{\log c})\right)n}$ time for instances with n variables and cn nodes.
