DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Planted clique
Planted clique
The Strongish Planted Clique Hypothesis and Its Consequences
Computational Lower Bounds for Community Detection on Random Graphs
Spectral Algorithms (Draft)
Public-Key Cryptography in the Fine-Grained Setting
A New Approach to the Planted Clique Problem
Lipics-CCC-2021-35.Pdf (1
Spectral Barriers in Certification Problems
Parameterized AC0 – Some Upper and Lower Bounds
Finding Planted Cliques in Sublinear Time
How to Play Unique Games Against a Semi-Random Adversary
Inapproximability of Maximum Biclique Problems, Minimum $ K $-Cut And
Planted Clique Detection Below the Noise Floor Using Low-Rank Sparse Pca
Is the Space Complexity of Planted Clique Recovery the Same As That of Detection?
Nuclear Norm Minimization for the Planted Clique and Biclique Problems∗
A Nearly Tight Sum-Of-Squares Lower Bound for the Planted Clique Problem
Spectral Approach to Modern Algorithm Design A
Finding a Large Hidden Clique in a Random Graph ∗
On Cryptanalysis Via Approximation of Cryptographic Primitives Relying on the Planted Clique Conjecture
Top View
Convex Relaxation for the Planted Clique, Biclique, and Clustering Problems
Small Clique Detection and Approximate Nash Equilibria
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
Search Problems:A Cryptographic Perspective
Almost-Polynomial Ratio ETH-Hardness of Approximating Densest K-Subgraph
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
A Lower Bound for Planted Clique in the Semi-Random Model
On the Hardness of Designing Public Signals∗
The Average-Case Complexity of Counting Cliques in Erdős-Rényi
Lecture 11: Average-Case Complexity - Hardness of SPCA Lecturer: Aviad Rubinstein Scribe: Yunsung Kim
Quantum Spectral Algorithms for Planted Clique
Open Problems / Boaz Barak
Public-Key Cryptography from Different Assumptions
Public Key Cryptography Based on the Clique and Learning Parity with Noise Problems for Post-Quantum Cryptography
Clique, Dominating Set, and More | SIAM Journal on Computing | Vol
Public Key Cryptography from Different Assumptions
Almost-Polynomial Ratio ETH-Hardness of Approximating
The Strongish Planted Clique Hypothesis and Its Consequences