The following pages link to (Q4763385):
Displaying 10 items.
- A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Quantum spectrum testing (Q2231675) (← 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)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Almost Transparent Short Proofs for NPℝ (Q3088268) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
