Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.

"I think that poetry is a way of thinking, a way of being in the world."

我总是试图把自己推到极限，看看我能走多远。

最好的谎言是我们对自己说的那些。