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.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Checker for data structures which sort elements (Q293137) (← links)
- A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
- Large values of the Gowers-Host-Kra seminorms (Q351328) (← links)
- Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
- Property testing for cyclic groups and beyond (Q386421) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- Local correction of juntas (Q437678) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Certifying algorithms (Q465678) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Observing biases in the state: case studies with Trivium and Trivia-SC (Q510484) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- The fault tolerance of NP-hard problems (Q553311) (← links)
- Quantum property testing of group solvability (Q627520) (← links)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- A property tester for tree-likeness of quartet topologies (Q649111) (← links)
- On-line approximate string matching with bounded errors (Q653329) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- Checking the correctness of memories (Q890427) (← links)
- 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)
