• = Discrete things
    • Logic, sets, graphs, etc.
  • They tend to cause combinatorial explosion and searching them naively can be very time-consuming.
    • Discrete algorithms manage to handle this through clever algorithm design.

(From the book “Master of Information Science”)