Dynamic Programming

• Equivalence node may be used in multiple places
• Compute its cost once and reuse
  • dynamic programming
  • store best plan, cost for each (equivalence node, physical prop. vector) pair that is required (i.e. generate only useful ones)