Pages that link to "Item:Q3158518"
From MaRDI portal
The following pages link to Property testing and its connection to learning and approximation (Q3158518):
Displaying 50 items.
- Min sum clustering with penalties (Q976485) (← links)
- Generalizations of the removal lemma (Q987562) (← links)
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
- Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Testing algebraic geometric codes (Q1047829) (← links)
- Approximate testing and its relationship to learning (Q1389650) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Spot-checkers (Q1577018) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Proofs of proximity for context-free languages and read-once branching programs (Q1640993) (← links)
- When distributed computation is communication expensive (Q1689746) (← links)
- Estimating the distance to a hereditary graph property (Q1689980) (← links)
- The Bradley-Terry condition is \(L_1\)-testable (Q1699573) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Testing piecewise functions (Q1786590) (← 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)
- A quantitative Arrow theorem (Q1930856) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions (Q1993748) (← links)
- Quantum algorithms for learning Walsh spectra of multi-output Boolean functions (Q2100831) (← links)
- Sharp local minimax rates for goodness-of-fit testing in multivariate binomial and Poisson families and in multinomials (Q2102432) (← links)
- Testing graphs against an unknown distribution (Q2130521) (← links)
- Local minimax rates for closeness testing of discrete distributions (Q2137011) (← links)
- Induced arithmetic removal: complexity 1 patterns over finite fields (Q2142699) (← links)
- An optimal tester for \(k\)-linear (Q2154097) (← links)
- Estimating the number of connected components in a graph via subgraph sampling (Q2174974) (← links)
- Efficient removal lemmas for matrices (Q2183099) (← links)
- Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- Moments of two-variable functions and the uniqueness of graph limits (Q2379365) (← links)
- A lower bound for testing juntas (Q2390270) (← links)
- Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
- Property testing on \(k\)-vertex-connectivity of graphs (Q2428696) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Testing consistency of quartet topologies: a parameterized approach (Q2445322) (← links)
