Pages that link to "Item:Q1317490"
From MaRDI portal
The following pages link to Self-testing/correcting with applications to numerical problems (Q1317490):
Displayed 31 items.
- Quantum property testing of group solvability (Q627520) (← 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)
- 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)
- 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)
- Testing of matrix-poset properties (Q2460630) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← 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)
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (Q3608306) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- Simple analysis of graph tests for linearity and PCP (Q4800393) (← links)
- Testing problems with sublearning sample complexity (Q5929914) (← links)
- Linear-consistency testing. (Q5946056) (← links)