Construct · 1 fields · 1 citations

#P-completeness: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
#P-completeness1 CONSTRUCT#P-completenessVALIANT · COMPUTATIONAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

hardness for the class of counting problems, shown even for the permanent whose matching decision version is easy.

In computational complexity, #P-completeness refers to hardness for the class of counting problems, shown even for the permanent whose matching decision version is easy. This meaning comes from Valiant (1979) in Theoretical Computer Science.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how #P-completeness sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

class3 fields · 3 citationsjingle · one word, three constructscomplexity4 fields · 7 citationsjingle · one word, four constructshardness4 fields · 4 citationsjingle · one word, four constructs

References

  1. Valiant, L. G. (1979). The complexity of computing the permanent. Theoretical Computer Science, 8(2), 189-201. https://doi.org/10.1016/0304-3975(79)90044-6

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct