1. A method for building binary decision diagrams comprising: traversing a netlist graph in a depth-first maimer; building at least one binary decision diagram for a first input of at least one node of said netlist graph using one or more binary decision diagrams for a second input of said at least one node as a don't-care condition.