Glaßer et al. (SIAMJCOMP 2009 and TCS 2009) proved that NP-complete languages are polynomial-time mitotic for the many-one reduction, meaning that each NP-complete language L can be split into two NP-complete languages $L\cap S$ and $L\cap \bar{S}$, where S is a language in P. It follows that every NP-complete language can be partitioned into an arbitrary finite number of NP-complete languages. We strengthen and generalize this result by showing that every NP-complete language can be partitioned into infinitely many NP-complete languages. Furthermore those NP-complete languages resulting from such partitioning can be effectively presented.

格拉瑟等人。（SIAMJCOMP 2009 和 TCS 2009）证明 NP 完全语言对于多一约简而言是多项式时间有丝分裂，这意味着每个 NP 完全语言L可以分为两个 NP 完全语言$L\cap S$和$L\cap \bar{S}$，其中S是 P 中的一种语言。由此可见，每个 NP 完全语言都可以划分为任意有限数量的 NP 完全语言。我们通过证明每个 NP 完全语言都可以划分为无限多个 NP 完全语言来加强和推广这个结果。此外，可以有效地呈现由这种划分产生的那些NP完全语言。