2 problems

Stable-algorithm optimality conjecture. The failure of stable algorithms should delineate the true computational hardness threshold of a problem.

Let $kappa>0$ and let the symmetric binary perceptron (SBP) have constraint density $alpha$. A search algorithm is stable when it satisfies the stability notion used in the paper.…