The Bradley-Terry condition is \(L_1\)-testable (Q1699573): Difference between revisions

@@ Property / cites work @@
+A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
+Normal rank
@@ Property / cites work @@
+Easily Testable Graph Properties
@@ Property / cites work: Easily Testable Graph Properties / 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 @@
+L             <sub>p</sub>             -testing
@@ Property / cites work: L <sub>p</sub> -testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5812580
@@ Property / cites work: Q5812580 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph removal lemmas
@@ Property / cites work: Graph removal lemmas / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994362
@@ Property / cites work: Q3994362 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / 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 @@
+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