Pages that link to "Item:Q4527016"
From MaRDI portal
The following pages link to Improved low degree testing and its applications (Q4527016):
Displaying 25 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- On the minimum label spanning tree problem (Q1567494) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Approximation algorithms for terrain guarding. (Q1603553) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Algebraic testing and weight distributions of codes. (Q1874387) (← links)
- On the hardness of the minimum height decision tree problem (Q1885823) (← links)
- On membership comparable sets (Q1961377) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- Improved low-degree testing and its applications (Q2494418) (← links)
- Three-player entangled XOR games are NP-hard to approximate (Q2816299) (← links)
- Self-correctors for Cryptographic Modules (Q3104690) (← links)
- Cube vs. Cube Low Degree Test. (Q4638094) (← links)
- Self-correcting for function fields of finite transcendental degree (Q4645210) (← links)
- Simple analysis of graph tests for linearity and PCP (Q4800393) (← links)
- Robust Characterizations of Polynomials with Applications to Program Testing (Q4877517) (← links)
- Linear consistency testing (Q4941830) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Approximate evaluations of characteristic polynomials of Boolean functions (Q5958111) (← links)
