Boolean Covering

• Dynamic Programming again:

  • More complexity - more possible matches to consider
  • Trees not required.

• Current prefered commercial approach

Previous slide

Next slide

Back to first slide

View graphic version