Planted clique

Planted clique

Playing 1/13
  • Bean Time-Lapse - 25 days | Soil cross section

    YouTube 03:10
  • Using Clique To Set Variables - Intro to Theoretical Computer Science

    YouTube 02:45

    YouTube 03:14

    YouTube 03:18
  • Unboxing and test review Chihiros RGB A plus series ADA style Plant grow LED light

    YouTube 03:49
  • What is Machine Learning?

    YouTube 02:19
  • What is Absolute Value? | Absolute Value Examples

    YouTube 02:51
  • Game Theory 101: What Is a Nash Equilibrium? (Stoplight Game)

    YouTube 06:03
  • How to Read an Adjacency Matrix | Pass the ARE 5.0

    YouTube 02:10
  • How are Angles Measured in Degrees? | Don't Memorise

    YouTube 03:58
  • Problem - Decision (Feat. StoneyThaDealer) [Mollywood 3: The Relapse (Side B)] [2015] + DOWNLOAD

    YouTube 02:49
  • Erdos Renyi - Intro to Algorithms

    YouTube 00:49
  • Computational hardness assumption

    YouTube 03:06

In computational complexity theory, a planted clique or hidden clique in an undirected graph is a clique formed from another graph by selecting a subset of vertices and adding edges between each pair of vertices in the subset. The planted clique problem is the algorithmic problem of distinguishing random graphs from graphs that have a planted clique. This is a variation of the clique problem; it may be solved in quasi-polynomial time but is conjectured not to be solvable in polynomial time for intermediate values of the clique size. The conjecture that no polynomial time solution exists is called the planted clique conjecture; it has been used as a computational hardness assumption.

Discover in context

This site is not available in the landscape mode.
Please rotate your phone or install our app.