Sept. 19, 2002

Workshop on
Boolean Problems

Node Simplification

Compute and use complete flexibility (CF) to simplify
the node. Recall:

1.CF in global space:

2.CF in local space:

•Use to optimize MV-SOP (heuristic,
exact) at node *j*

We will look at how to find the smallest
well-defined SOP
representation contained in a given
ND relation