four steps:
1. throw an NP-complete problem, ask for efficient algorithm:)
2. Of course no one can solve it. Then ask to prove the NP-completeness by
reduction.
3. ask for an approximate algorithm.
4. prove the bound of this approximate algorithm.
k*******d 发帖数: 1340
2
非CS专业的基本都玩完了...
m*******r 发帖数: 98
3
this process tests the "design" and "analysis" of algorithms
