4 problems

Let ${\sf HG}^s(n,1/2)$ be the Erdős–Rényi distribution on $s$-uniform hypergraphs and ${\sf HPC}_{\sf D}^s(n,k)$ the hypothesis-testing problem obtained by using the unconditioned…

Let ${\sf HG}^s(n,1/2)$ be the Erdős–Rényi distribution on $s$-uniform hypergraphs and ${\sf clHG}^s(n,1/2,k)$ the planted clique distribution conditioned on the first $s-2$ vertic…

Let ${\sf clkG}(\ell k,1/2,k)$ be the $k$-partite planted clique distribution conditioned on vertex $1$ belonging to the planted clique, and let ${\sf clkPC}_{\sf D}(\ell k,k)$ be…

Let $G$sim${\sf G}(n,1/2)$ denote an Erdős–Rényi graph and ${\sf G}(n,1/2,k)$ the graph distribution with a uniformly random planted clique of size $k$. A randomized logspace algor…