Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387): Difference between revisions

@@ Property / cites work @@
+Efficient testing of large graphs
@@ Property / cites work: Efficient testing of large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Languages are Testable with a Constant Number of Queries
+Normal rank
@@ Property / cites work @@
+Lower bounds to the complexity of symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Q2768393
@@ Property / cites work: Q2768393 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing of matrix properties
@@ Property / cites work: Testing of matrix properties / rank @@
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Q4527008
@@ Property / cites work: Q4527008 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing Membership in Languages that Have Small Width Branching Programs
+Normal rank
@@ Property / cites work @@
+Testing metric properties
@@ Property / cites work: Testing metric properties / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank