Title of article

Lower bounds on the OBDD size of two fundamental functionsʹ graphs

Author/Authors

Daniel Sawitzki، نويسنده ,

Issue Information

دوهفته نامه با شماره پیاپی سال 2007

Pages

6

From page

66

To page

71

Keywords

computational complexity , data structures , analysis of algorithms , Theory of computation

Journal title

Information Processing Letters

Serial Year

2007

Journal title

Information Processing Letters

Record number

130358