Pages that link to "Item:Q2494418"
From MaRDI portal
The following pages link to Improved low-degree testing and its applications (Q2494418):
Displayed 12 items.
- Quantum information and the PCP theorem (Q835644) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- A note on the hardness results for the labeled perfect matching problems in bipartite graphs (Q3598040) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q4933379) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- Some Recent Results on Local Testing of Sparse Linear Codes (Q4933384) (← links)
- Local Property Reconstruction and Monotonicity (Q4933387) (← links)