How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
Randomness in interactive proofs
Computational Complexity
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Extractors from Reed-Muller Codes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
On the Randomness Complexity of Property Testing
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
A brief introduction to property testing
Studies in complexity and cryptography
| Hi-index | 0.00 |
We observe that the randomness-complexity of an algorithm effects the time-complexity of implementing a version of it that utilizes a weak source of randomness (through a randomness-extractor). This provides an additional motivation for the study of the randomness complexity of randomized algorithms. We note that this motivation applies especially in the case that derandomization is prohibitingly costly.