Halloween

Edit Answers
12345678910111213
Across
  1. 1. Making the locally optimal choice
  2. 7. Every possible combination
  3. 9. Time complexity is O(m.n)
  4. 11. A NP-C problem
  5. 12. Time complexity is O((n-m+1)m)
  6. 13. Time complexity is O(n power 3)
Down
  1. 2. prepossessing time is O(m)
  2. 3. Overlapping subproblems
  3. 4. Time complexity is O(n power 3)
  4. 5. Time complexity O(2 power n)without DP
  5. 6. prepossessing time is O(m |Σ|)
  6. 8. Best String matcher
  7. 10. backtracking
  8. 12. NP-H + NP