Categories
  Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

#P

From Wikipedia (Zh) - Reading time: 4 min

计算复杂性理论中,#P(读作sharp P)是一组与NP中的判定性问题相关的计数问题。

外部連結

[编辑]

Licensed under CC BY-SA 3.0 | Source: https://zh.wikipedia.org/wiki/#P
12 views | Status: cached on November 15 2024 07:49:46
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF