在计算复杂性理论中,#P(读作sharp P)是一组与NP中的判定性问题相关的计数问题。
此條目需要擴充。 (2010年3月29日) |
P ≟ NP | 这是一篇关于计算理论的小作品。你可以通过编辑或修订扩充其内容。 |
This article uses material from the Wikipedia 中文 article #P, which is released under the Creative Commons Attribution-ShareAlike 3.0 license ("CC BY-SA 3.0"); additional terms may apply (view authors). 除非另有声明,本网站内容采用CC BY-SA 4.0授权。 Images, videos and audio are available under their respective licenses.
®Wikipedia is a registered trademark of the Wiki Foundation, Inc. Wiki 中文 (DUHOCTRUNGQUOC.VN) is an independent company and has no affiliation with Wiki Foundation.