Size and Structure of Random Ordered Binary Decision Diagrams Preliminary Dissertation Version — compiled September 22 , 1998

Abstract

Abstract. We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. Wegener (1994) showed that for “most” values of n , the expected OBDD-size of a random Boolean function with n variables equals the worst-case size up to terms of lower order. Our main result is that this phenomenon, also known as strong… (More)

6 Figures and Tables

Topics

  • Presentations referencing similar topics