Construct · 1 fields · 1 citations

planted clique problem: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed

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

Computational complexity

the task of finding a large clique hidden in a random graph, conjectured hard below square-root size and used as an average-case hardness assumption.

In computational complexity, planted clique problem refers to the task of finding a large clique hidden in a random graph, conjectured hard below square-root size and used as an average-case hardness assumption. This meaning comes from Jerrum (1992) in Random Structures & Algorithms.[1]

Unit
Recovery means
Measured by

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

See how planted clique problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

clique3 fields · 5 citationsjingle · one word, three constructs complexity4 fields · 7 citationsjingle · one word, four constructs hardness4 fields · 4 citationsjingle · one word, four constructs

References

Jerrum, M. (1992). Large Cliques Elude the Metropolis Process. Random Structures & Algorithms, 3(4), 347-359. https://doi.org/10.1002/rsa.3240030402

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