On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs
2002 ◽
Vol 178
(1)
◽
pp. 263-278
◽
The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
1994 ◽
Vol 43
(11)
◽
pp. 1262-1269
◽
1984 ◽
Vol 62
(2-3)
◽
pp. 129-143
◽
Keyword(s):
1991 ◽
Vol 138
(1)
◽
pp. 48
◽
2018 ◽
Vol 26
(3)
◽
pp. 115-140
Keyword(s):