Pages that link to "Item:Q4877517"

The following pages link to Robust Characterizations of Polynomials with Applications to Program Testing (Q4877517):

Displaying 50 items.

• Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
• A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
• Approximate membership for regular languages modulo the edit distance (Q387000) (← links)
• Hierarchy theorems for property testing (Q430844) (← links)
• Testable and untestable classes of first-order formulae (Q440006) (← links)
• Is submodularity testable? (Q472463) (← links)
• Testing outerplanarity of bounded degree graphs (Q494925) (← links)
• Shorter arithmetization of nondeterministic computations (Q496013) (← links)
• Symmetric LDPC codes and local testing (Q519972) (← links)
• Testing periodicity (Q534782) (← links)
• Testing convexity properties of tree colorings (Q547293) (← links)
• Testing permutation properties through subpermutations (Q551179) (← links)
• Testing juntas (Q598252) (← links)
• A new proof of the graph removal lemma (Q640795) (← links)
• A property tester for tree-likeness of quartet topologies (Q649111) (← links)
• Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
• Distributed discovery of large near-cliques (Q661050) (← links)
• The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
• Property testing lower bounds via communication complexity (Q693004) (← links)
• \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
• Arithmetic progressions, different regularity lemmas and removal lemmas (Q746166) (← links)
• Characterizations of locally testable linear- and affine-invariant families (Q764306) (← links)
• Testing computability by width-two OBDDs (Q764366) (← links)
• Property testing of the Boolean and binary rank (Q825974) (← links)
• Quantum information and the PCP theorem (Q835644) (← links)
• Lower bounds for testing Euclidean minimum spanning trees (Q846011) (← links)
• Fault detection tests for stuck-at faults on parity counter inputs (Q895069) (← links)
• Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
• Property-preserving data reconstruction (Q930593) (← links)
• A separation theorem in property testing (Q949795) (← links)
• Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
• Every minor-closed property of sparse graphs is testable (Q962147) (← links)
• Attribute estimation and testing quasi-symmetry (Q976083) (← 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 large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
• Testing algebraic geometric codes (Q1047829) (← 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)
• The Bradley-Terry condition is \(L_1\)-testable (Q1699573) (← links)
• Non-interactive proofs of proximity (Q1745962) (← 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)
• On the strength of comparisons in property testing (Q1887149) (← links)
• A quantitative Arrow theorem (Q1930856) (← links)