Pages that link to "Item:Q3158518"
From MaRDI portal
The following pages link to Property testing and its connection to learning and approximation (Q3158518):
Displayed 33 items.
- Testing juntas (Q598252) (← links)
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Information theory in property testing and monotonicity testing in higher dimension (Q859828) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Property-preserving data reconstruction (Q930593) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Spot-checkers (Q1577018) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Algebraic testing and weight distributions of codes. (Q1874387) (← links)
- Testing metric properties (Q1877548) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
- On the strength of comparisons in property testing (Q1887149) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Every Monotone 3-Graph Property is Testable (Q3439395) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (Q3520066) (← 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)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- Testing the diameter of graphs (Q4543626) (← links)
- Testing properties of directed graphs: acyclicity and connectivity* (Q4543627) (← links)
- Finding a Dense-Core in Jellyfish Graphs (Q5458298) (← links)
- Separating Sublinear Time Computations by Approximate Diameter (Q5505645) (← links)
- Testing subgraphs in directed graphs (Q5917574) (← links)