Invariance in Property Testing
type: Item
instance of: scholarly article
title: Invariance in Property Testing
zbMATH Open document ID: 1309.68055
DOI: 10.1007/978-3-642-16367-8_12
published in: Property Testing
publication date: 2010-10-12T00:00:00Z
Mathematics Subject Classification ID: 68P01
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5799059
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-16367-8 12
OpenAlex ID: W2128717558
cites work: Q3549649
cites work: A combinatorial characterization of the testable graph properties
cites work: Testing Reed–Muller Codes
cites work: Proof verification and the hardness of approximation problems
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: Locally Testable Cyclic Codes
cites work: The Complexity of Approximating the Entropy
cites work: Sublinear algorithms for testing monotone and unimodal distributions
cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results
cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
cites work: Some 3CNF Properties Are Hard to Test
cites work: Limits on the Rate of Locally Testable Affine-Invariant Codes
cites work: Testing Linear-Invariant Non-Linear Properties
cites work: Q5417609
cites work: Testing juntas nearly optimally
cites work: Self-testing/correcting with applications to numerical problems
cites work: Graph limits and parameter testing
cites work: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
cites work: Q4941829
cites work: Spot-checkers
cites work: Testing juntas
cites work: Testing monotonicity
cites work: Property testing and its connection to learning and approximation
cites work: Proximity Oblivious Testing and the Role of Invariances
cites work: On Testing Expansion in Bounded-Degree Graphs
cites work: Property testing in bounded degree graphs
cites work: On proximity oblivious testing
cites work: On the Randomness Complexity of Property Testing
cites work: Testing Fourier Dimensionality and Sparsity
cites work: A Szemerédi-type regularity lemma in abelian groups, with applications
cites work: 2-transitivity is insufficient for local testability
cites work: Succinct Representation of Codes with Applications to Testing
cites work: Testing low-degree polynomials over prime fields
cites work: Testing Polynomials over General Fields
cites work: Q3549724
cites work: Symmetric LDPC Codes and Local Testing
cites work: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
cites work: A combinatorial proof of the removal lemma for groups
cites work: Testing Basic Boolean Formulae
cites work: Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
cites work: On the Robustness of Functional Equations
cites work: Testing monotone high‐dimensional distributions
cites work: Robust Characterizations of Polynomials with Applications to Program Testing
cites work: Green's conjecture and testing linear-invariant properties
cites work: Q3549722
author: Madhu Sudan
description: scientific article; zbMATH DE number 5799059