Pages that link to "Item:Q1581792"

The following pages link to Hiding cliques for cryptographic security (Q1581792):

Displaying 16 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Optimal detection of sparse principal components in high dimension (Q385763) (← links)
• Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
• On the hardness of designing public signals (Q2278949) (← links)
• Computational barriers in minimax submatrix detection (Q2352736) (← links)
• Perfect Structure on the Edge of Chaos (Q2796138) (← links)
• The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture (Q2947167) (← links)
• Clustering and Categorization Applied to Cryptanalysis (Q3452653) (← links)
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← 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)
• \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)