Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Planted_clique> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Planted_clique abstract "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.".
- Planted_clique wikiPageID "48563244".
- Planted_clique wikiPageLength "9895".
- Planted_clique wikiPageOutDegree "25".
- Planted_clique wikiPageRevisionID "690889853".
- Planted_clique wikiPageWikiLink Absolute_value.
- Planted_clique wikiPageWikiLink Adjacency_matrix.
- Planted_clique wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Planted_clique wikiPageWikiLink Clique_(graph_theory).
- Planted_clique wikiPageWikiLink Clique_problem.
- Planted_clique wikiPageWikiLink Computational_complexity_theory.
- Planted_clique wikiPageWikiLink Computational_hardness_assumption.
- Planted_clique wikiPageWikiLink Decision_problem.
- Planted_clique wikiPageWikiLink Degree_(graph_theory).
- Planted_clique wikiPageWikiLink Eigenvalues_and_eigenvectors.
- Planted_clique wikiPageWikiLink Erdős–Rényi_model.
- Planted_clique wikiPageWikiLink Graph_(discrete_mathematics).
- Planted_clique wikiPageWikiLink K-independent_hashing.
- Planted_clique wikiPageWikiLink Machine_learning.
- Planted_clique wikiPageWikiLink Nash_equilibrium.
- Planted_clique wikiPageWikiLink Probability_distribution.
- Planted_clique wikiPageWikiLink Property_testing.
- Planted_clique wikiPageWikiLink Random_graph.
- Planted_clique wikiPageWikiLink Semidefinite_programming.
- Planted_clique wikiPageWikiLink Time_complexity.
- Planted_clique wikiPageWikiLinkText "planted clique conjecture".
- Planted_clique wikiPageWikiLinkText "planted clique".
- Planted_clique wikiPageUsesTemplate Template:Harvtxt.
- Planted_clique wikiPageUsesTemplate Template:Math.
- Planted_clique wikiPageUsesTemplate Template:Mvar.
- Planted_clique wikiPageUsesTemplate Template:Reflist.
- Planted_clique subject Category:Computational_problems_in_graph_theory.
- Planted_clique hypernym Clique.
- Planted_clique comment "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.".
- Planted_clique label "Planted clique".
- Planted_clique wasDerivedFrom Planted_clique?oldid=690889853.
- Planted_clique isPrimaryTopicOf Planted_clique.