The following pages link to (Q4705344):
Displayed 50 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- On combinatorial testing problems (Q605939) (← links)
- Nuclear norm minimization for the planted clique and biclique problems (Q717132) (← links)
- Robust exponential memory in Hopfield networks (Q723688) (← links)
- Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Community detection in sparse random networks (Q894814) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Information-theoretic thresholds from the cavity method (Q1649349) (← links)
- Random perturbation of low rank matrices: improving classical bounds (Q1688904) (← links)
- Recovering the structure of random linear graphs (Q1790469) (← links)
- Finding a large submatrix of a Gaussian random matrix (Q1991667) (← links)
- Recovering nonuniform planted partitions via iterated projection (Q2002551) (← links)
- The overlap gap property in principal submatrix recovery (Q2067659) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Statistical and computational limits for sparse matrix detection (Q2196237) (← links)
- Cliques in rank-1 random graphs: the role of inhomogeneity (Q2278662) (← links)
- Metastability in stochastic replicator dynamics (Q2280198) (← links)
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) (← links)
- Detecting positive correlations in a multivariate sample (Q2345119) (← links)
- Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
- Convex optimization for the planted \(k\)-disjoint-clique problem (Q2436653) (← links)
- Community detection in dense random networks (Q2510823) (← links)
- The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture (Q2947167) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- On independent sets in random graphs (Q3452727) (← links)
- Graph Partitioning via Adaptive Spectral Techniques (Q3557535) (← links)
- Community Detection and Stochastic Block Models (Q4558502) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- A Simple SVD Algorithm for Finding Hidden Partitions (Q4601058) (← links)
- Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (Q4609470) (← links)
- Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time (Q4684942) (← links)
- Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model (Q5020005) (← links)
- What Is Learned in Knowledge Graph Embeddings? (Q5050385) (← links)
- (Q5075740) (← links)
- Finding a planted clique by adaptive probing (Q5126325) (← links)
- Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- (Q5159420) (← links)
- Computational and statistical tradeoffs via convex relaxation (Q5170958) (← links)
- Testing for Dense Subsets in a Graph via the Partition Function (Q5212953) (← links)
- Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs (Q5234663) (← links)
- Finding Hidden Cliques in Linear Time with High Probability (Q5414144) (← links)
- A Unifying Tutorial on Approximate Message Passing (Q5863992) (← links)
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)