2 problems

Leftover-regime conjecture. No polynomial-time algorithm exists for detecting the planted subgraph.

The dense subgraph detection conjecture. For any sequence of randomized polynomial-time tests $(\psi_n)_n$,