Rethinking P/NP Problem
Abstract In this brief essay, we revisit the P/NP problem and explore some intriguing perspectives. The goal is to provide a simplified yet insightful discussion that complements existing literature.
Introduction The P/NP problem is one of the most significant open questions in computer science. It asks whether every problem whose solution can be quickly verified can also be quickly solved.
Discussion Recently, FTLian presented an interesting take on this problem in their blog post “P≠NP”.
好东西分享
网站：纸飞机折法大全 https://www.foldnfly.com
文章：简单科普底类型（Bottom Type）、单元类型（Unit Type）以及顶类型（Top Type） [知乎专栏] https://zhuanlan.zhihu.com/p/677605002
