Pages that link to "Item:Q2986237"
From MaRDI portal
The following pages link to Hidden Cliques and the Certification of the Restricted Isometry Property (Q2986237):
Displaying 11 items.
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing (Q1664790) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Non-Negative Sparse Regression and Column Subset Selection with L1 Error (Q4993270) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
- Subexponential-time algorithms for sparse PCA (Q6566150) (← links)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)
