MathDB2 problems
- 0 votes0 replies1 view
The computational gap conjecture for higher-order network parameter estimation
Computational gap conjecture. When the MLE fails to exist, there is an intrinsic gap between the information-theoretic lower bound on estimation risk and the performance achievable…
- 0 votes0 replies1 view
The computational hardness conjecture for planted clique detection and Boolean satisfiability
Computational hardness assumptions such as planted clique detection and Boolean satisfiability concern decision problems for which one seeks an efficient algorithm. Computational h…