Title of article :
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs
Author/Authors :
Beate Bollig، نويسنده , , Martin Sauerhoff، نويسنده , , Ingo Wegener، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Keywords :
computational complexity , branching programs , binary decision diagrams , approximations , lower bounds.
Journal title :
Information and Computation
Journal title :
Information and Computation
