Pages that link to "Item:Q1346695"

The following pages link to Expected complexity of graph partitioning problems (Q1346695):

Displaying 24 items.

• Optimal detection of sparse principal components in high dimension (Q385763) (← links)
• Comment on ``Hypothesis testing by convex optimization'' (Q491382) (← links)
• A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
• The complexity of explicit constructions (Q693069) (← links)
• Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
• A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
• Recovering nonuniform planted partitions via iterated projection (Q2002551) (← links)
• Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
• On the hardness of designing public signals (Q2278949) (← links)
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) (← links)
• Computational barriers in minimax submatrix detection (Q2352736) (← links)
• Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
• Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
• The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture (Q2947167) (← links)
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
• The forgetfulness of balls and bins (Q4909203) (← links)
• The Complexity of Public-Key Cryptography (Q5021130) (← links)
• Finding a planted clique by adaptive probing (Q5126325) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• Finding Hidden Cliques in Linear Time with High Probability (Q5414144) (← links)
• Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
• Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)
• How to hide a clique? (Q6614612) (← links)
• The landscape of the planted clique problem: dense subgraphs and the overlap gap property (Q6616866) (← links)