The complexity of promise problems with applications to public-key cryptography
Information and Control
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Three theorems regarding testing graph properties
Random Structures & Algorithms
On Derandomizing Probabilistic Sublinear-Time Algorithms
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
On The Randomness Complexity of Property Testing
Computational Complexity
| Hi-index | 0.00 |
Motivated by a study of Zimand (22nd CCC, 2007), we consider the average-case complexity of property testing (focusing, for clarity, on testing properties of Boolean strings). We make two observations: