Gröpl, C. and Prömel, H.-J. and Srivastav, A.
(2001)
*On the Evolution of the Worst-Case OBDD Size.*
Information Processing Letters, 77
.
pp. 1-7.

Full text not available from this repository.

## Abstract

We prove matching lower and upper bounds on the worst-case OBDD size of a Boolean function, revealing an interesting ocillating behaviour.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | Binary Decision Diagrams |

Subjects: | Mathematical and Computer Sciences > Computer Science |

Divisions: | Department of Mathematics and Computer Science > Institute of Computer Science > Algorithmic Bioinformatics Group |

ID Code: | 361 |

Deposited By: | Admin Administrator |

Deposited On: | 14 Apr 2009 14:40 |

Last Modified: | 14 Apr 2009 14:40 |

Repository Staff Only: item control page