Hard Problems Some problems are hard to solve. No polynomial time algorithm is known Most combinatorial optimization problems are hard Popular NP-hard.
STAT: Counting principles(2)
Stochastic Methods A Review (Mostly). Relationship between Heuristic and Stochastic Methods Heuristic and stochastic methods useful where –Problem does.
I/O-Algorithms
