On proximity oblivious testing

DOI10.1145/1536414.1536436zbMath1304.05134OpenAlexW1972384144MaRDI QIDQ5172707

Oded Goldreich, Dana Ron

Publication date: 4 February 2015

Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1536414.1536436

zbMATH Keywords

property testinggraph propeties

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (6)

Recognizing Coverage Functions ⋮ Algorithmic Aspects of Property Testing in the Dense Graphs Model ⋮ Non-interactive proofs of proximity ⋮ Invariance in Property Testing ⋮ Testing Linear-Invariant Non-linear Properties: A Short Report ⋮ Testing Graph Blow-Up

This page was built for publication: On proximity oblivious testing