I don't focus on what I'm up against. I focus on my goals and I try to ignore the rest.
In the realm of algorithms, efficiency and elegance are not mutually exclusive but are often two sides of the same coin.
NP中的每个问题都可以归约为可满足性问题,这是计算复杂性理论的基石。