@MISC{Of02optimalfree, author = {For Computation Of}, title = {Optimal Free Binary Decision Diagrams}, year = {2002} }

Share

OpenURL

Abstract

Free binary decision diagrams (FBDDs) are graph{based data structures representing Boolean functions with a constraint (additional to binary decision diagrams) that each variable is tested during the computation at most once. The function EARn is a Boolean function on n n Boolean matrices; EARn (M) = 1 i the matrix M contains two equal adjacent rows. We prove that the size of optimal FBDDs computing EARn is 2 .