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.
- New publicly verifiable computation for batch matrix multiplication (Q2004759) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Subversion-resilient public key encryption with practical watchdogs (Q2061938) (← links)
- Quantum cryptographic property testing of multi-output Boolean functions (Q2100834) (← links)
- Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions (Q2130055) (← links)
- Testing graphs against an unknown distribution (Q2130521) (← links)
- An optimal tester for \(k\)-linear (Q2154097) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Efficient and secure delegation of exponentiation in general groups to a single malicious server (Q2209264) (← links)
- Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- High order differential attacks on stream ciphers (Q2376658) (← links)
- Applying cube attacks to stream ciphers in realistic scenarios (Q2376659) (← links)
- A lower bound for testing juntas (Q2390270) (← links)
- Secure outsourcing of modular exponentiations under single untrusted programme model (Q2403228) (← links)
- On the derandomization of the graph test for homomorphism over groups (Q2430014) (← links)
- Approximately classic judgement aggregation (Q2436699) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Testing consistency of quartet topologies: a parameterized approach (Q2445322) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- 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)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2) (Q3541815) (← links)
