Pages that link to "Item:Q4577186"
From MaRDI portal
The following pages link to On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186):
Displaying 13 items.
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- SAT distributions with planted assignments and phase transitions between decision and optimization problems (Q2581547) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
- (Q4739606) (← links)
- (Q4999009) (← links)
- (Q5148942) (← links)
- Statistical algorithms and a lower bound for detecting planted cliques (Q5495836) (← links)
- Polynomial‐time universality and limitations of deep learning (Q6074573) (← links)
- Adversarial manifold estimation (Q6118078) (← links)
- Statistical-computational trade-offs in tensor PCA and related problems via communication complexity (Q6151966) (← links)
- Computational lower bounds for graphon estimation via low-degree polynomials (Q6656622) (← links)
