Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
NP中的每个问题都可以归约为可满足性问题,这是计算复杂性理论的基石。
我认为最重要的事情就是对自己和他人友善。
如果你不去追求你想要的,你将永远得不到它。
成功在于坚持和永不放弃。
The ultimate aim of artificial intelligence is to make computers do things that would require intelligence if done by humans.