Pages that link to "Item:Q4977966"
From MaRDI portal
The following pages link to Strongly refuting random CSPs below the spectral threshold (Q4977966):
Displaying 13 items.
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- (Q4993325) (← links)
- (Q5002634) (← links)
- Disordered systems insights on computational hardness (Q5055432) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- (Q5158503) (← links)
- (Q6062142) (← links)
- Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random (Q6083522) (← links)
- Subexponential-time algorithms for sparse PCA (Q6566150) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- Complexity theory. Abstracts from the workshop held June 2--7, 2024 (Q6671624) (← links)
