Publication:3549648
From MaRDI portal
zbMath1232.68174MaRDI QIDQ3549648
Publication date: 5 January 2009
hypergraphs; testability; randomized algorithms; removal lemma; hereditary graph properties; property testers
Related Items
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Indistinguishability and First-Order Logic, Relational Properties Expressible with One Universal Quantifier Are Testable