Pages that link to "Item:Q3581280"
From MaRDI portal
The following pages link to Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (Q3581280):
Displayed 26 items.
- A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Analysis of properties of quantum hashing (Q2331334) (← links)
- Low-degree test with polynomially small error (Q2410685) (← links)
- On the derandomization of the graph test for homomorphism over groups (Q2430014) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Testing properties of functions on finite groups (Q2830241) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2) (Q3541815) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- (Q5002642) (← links)
- Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations (Q5042223) (← links)
- (Q5140839) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Direct Sum Testing (Q5348457) (← links)
- Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions (Q5436976) (← links)
- Robust locally testable codes and products of codes (Q5486320) (← links)
- Testing Odd Direct Sums Using High Dimensional Expanders (Q5875508) (← links)