Programming, Binary Decision Diagrams, Computer Science, Boolean.
performing a depth-first search to a 1 terminal node. With these implementations, BDD operations have the following worst-case runtimes (in expectation, due to constant-time random hashing): Operations + runtimes for BDDs. From http://www.cs.utexas.edu/~isil/cs389L/bdd.pdf. Conclusion BDDs are a