Pages that link to "Item:Q2494418"
From MaRDI portal
The following pages link to Improved low-degree testing and its applications (Q2494418):
Displaying 37 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- Quantum information and the PCP theorem (Q835644) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Low-degree test with polynomially small error (Q2410685) (← 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)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Characterizing Arithmetic Read-Once Formulae (Q2828215) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← 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)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← 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)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5002642) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- (Q5093398) (← links)
- (Q5121905) (← links)
- (Q5121912) (← links)
- (Q5140839) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)