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.
- Fault detection tests for stuck-at faults on parity counter inputs (Q895069) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
- Property-preserving data reconstruction (Q930593) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Pipelined algorithms to detect cheating in long-term grid computations (Q959812) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Spot-checkers (Q1577018) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Empirical analysis of algorithms for the shortest negative cost cycle problem (Q1634773) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- Algebraic testing and weight distributions of codes. (Q1874387) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Testing nonlinear operators (Q1895875) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Low redundancy polynomial checks for numerical computation (Q1925011) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← links)
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
- 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)
