Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254): Difference between revisions

@@ Property / cites work @@
+Testing subgraphs in large graphs
@@ Property / cites work: Testing subgraphs in large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial characterization of the testable graph properties
+Normal rank
@@ Property / cites work @@
+Testing subgraphs in directed graphs
@@ Property / cites work: Testing subgraphs in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Every Monotone Graph Property Is Testable
@@ Property / cites work: Every Monotone Graph Property Is Testable / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549723
@@ Property / cites work: Q3549723 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+Normal rank
@@ Property / cites work @@
+A generalized Turán problem and its applications
@@ Property / cites work: A generalized Turán problem and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Property Testing
@@ Property / cites work: Introduction to Property Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Hierarchy theorems for property testing
@@ Property / cites work: Hierarchy theorems for property testing / rank @@
+Normal rank
@@ Property / cites work @@
+Property testing in bounded degree graphs
@@ Property / cites work: Property testing in bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank