Exponential Lower Bounds on the Size of Variants of OBDD Representing Integer Division Takashi HORIYAMAShuzo YAJIMA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1998/08/25 Vol. E81-DNo. 8 ;
pp. 793-800 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: Boolean function, division, binary decision diagrams, lower bound, fooling set,