Pages that link to "Item:Q1317490"
From MaRDI portal
The following pages link to Self-testing/correcting with applications to numerical problems (Q1317490):
Displaying 50 items.
- Property testing and expansion in cubical complexes (Q2664114) (← links)
- A quantum algorithm to estimate the Gowers \(U_2\) norm and linearity testing of Boolean functions (Q2681684) (← links)
- An optimal tester for \(k\)-Linear (Q2690878) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- Testing properties of functions on finite groups (Q2830241) (← links)
- Robust characterizations of <i>k</i> -wise independence over product spaces and related testing results (Q2856576) (← links)
- Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks (Q2946893) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- A Canonical Form for Testing Boolean Function Properties (Q3088118) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- A Brief Introduction to Property Testing (Q3088197) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- Self-correctors for Cryptographic Modules (Q3104690) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- A query efficient non-adaptive long code test with perfect completeness (Q3192387) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- (Q4638085) (← links)
- Simple analysis of graph tests for linearity and PCP (Q4800393) (← links)
- A unified framework for testing linear‐invariant properties (Q4982614) (← links)
- (Q4993289) (← links)
- Sample-Based High-Dimensional Convexity Testing. (Q5002640) (← links)
- (Q5002642) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- (Q5009536) (← links)
- (Q5009557) (← links)
- An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- (Q5090398) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- (Q5090443) (← links)
- Almost optimal distribution-free junta testing (Q5091752) (← links)
- (Q5093398) (← links)
- (Q5121905) (← links)
- (Q5121908) (← links)
- Safety assurance via on-line monitoring (Q5138497) (← links)
- (Q5140837) (← links)
- (Q5140839) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- (Q5857610) (← links)
- (Q5875496) (← links)
- Testing Odd Direct Sums Using High Dimensional Expanders (Q5875508) (← links)
- Stability of approximate group actions: uniform and probabilistic (Q6057872) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
- Almost Optimal Testers for Concise Representations. (Q6084348) (← links)
