On the strength of comparisons in property testing
type: Item
instance of: scholarly article
title: On the strength of comparisons in property testing
zbMATH Open document ID: 1090.68051
author: Eldar Fischer
published in: Information and Computation
publication date: 2004-11-23T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 2118414
zbMATH Keywords: Property testing
zbMATH Keywords: Monotonicity
zbMATH Keywords: Ramsey's theorem
MaRDI profile type: Publication
full work available at URL: j.ic.2003.09.003
OpenAlex ID: W2016443407
cites work: Efficient testing of large graphs
cites work: Regular languages are testable with a constant number of queries
cites work: Q3852212
cites work: Transforming comparison model lower bounds to the parallel-random-access-machine
cites work: Q4941829
cites work: Spot-checkers
cites work: Monotonicity testing over general poset domains
cites work: Testing monotonicity
cites work: Property testing and its connection to learning and approximation
cites work: Property testing in bounded degree graphs
cites work: Q3997075
cites work: Robust Characterizations of Polynomials with Applications to Program Testing
DOI: 10.1016/J.IC.2003.09.003
description: scientific article; zbMATH DE number 2118414