Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Journal of Combinatorial Theory Series A
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved Testing Algorithms for Monotonicity
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
Estimating the distance to a monotone function
Random Structures & Algorithms
Testing monotonicity over graph products
Random Structures & Algorithms
Approximating the influence of monotone boolean functions in O(√n) query complexity
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Property Testing Lower Bounds via Communication Complexity
Computational Complexity - Selected papers from the 26th Annual IEEE Conference on Computational Complexity (CCC 2011)
| Hi-index | 0.00 |
Given oracle access to a Boolean function f:{0,1}n - {0,1}, we design a randomized tester that takes as input a parameter ε0, and outputs Yes if the function is monotonically non-increasing, and outputs No with probability 2/3, if the function is ε-far from being monotone, that is, f needs to be modified at ε-fraction of the points to make it monotone. Our non-adaptive, one-sided tester makes ~O(n5/6ε-5/3) queries to the oracle.