- P or NP classification based entirely on worst-case analysis
- Problem banished from P if one instance requires exponential solution time
- Overconstrained and underconstrained are easy
- Really hard problems occur on boundary between these regions
- Probability of a Hamiltonian Circuit as average connectivity varies
- Almost fully connected almost always has HC
- With connectivity of just over 2, almost never has HC