NP完全性不仅仅是一个理论上的好奇心;它对实际计算有着深远的影响。
NP-completeness is not just a theoretical curiosity; it has profound implications for practical computing.
If you want to go fast, go alone. If you want to go far, go together.
It has always been easy to hate and destroy. To build and to cherish is much more difficult.