Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellare, M., Goldreich, O., Goldwasser, S.: Randomness in Interactive Proofs. Computational Complexity 4(4), 319–354 (1993)
Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing 13, 850–864 (1984); Preliminary Version in 23rd FOCS (1982)
Goldreich, O.: Foundation of Cryptography – Basic Tools. Cambridge University Press, Cambridge (2001)
Goldreich, O.: A Brief Introduction to Property Testing. In: Goldreich, O., et al.: Studies in Complexity and Cryptography. LNCS, vol. 6650, pp. 557–562. Springer, Heidelberg (2011)
Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. Journal of the ACM 33(4), 792–807 (1986)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM, 653–750 (July 1998)
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica, 302–343 (2002)
Goldreich, O., Ron, D.: A sublinear bipartite tester for bounded degree graphs. Combinatorica 19(3), 335–373 (1999)
Goldreich, O., Sheffet, O.: On the randomness complexity of property testing. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 509–524. Springer, Heidelberg (2007)
Ron, D.: Algorithmic and Analysis Techniques in Property Testing. Foundations and Trends in TCS 5(2), 73–205 (2010)
Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 252–271 (1996)
Sheffet, O.: M.Sc.Thesis, Weizmann Institute of Science (in preparation), http://www.wisdom.weizmann.ac.il/~oded/msc-os.html
Shaltiel, R.: Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS  77, 67–95 (2002)
Shaltiel, R., Umans, C.: Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. In: 32nd IEEE Symposium on Foundations of Computer Science, pp. 648–657 (2001)
Ta-Shma, A., Zuckerman, D., Safra, S.: Extractors from Reed-Muller Codes. In: 32nd IEEE Symposium on Foundations of Computer Science, pp. 638–647 (2001)
Yao, A.C.: Theory and Application of Trapdoor Functions. In: 23rd IEEE Symposium on Foundations of Computer Science, pp. 80–91 (1982)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Goldreich, O. (2011). Another Motivation for Reducing the Randomness Complexity of Algorithms. In: Goldreich, O. (eds) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science, vol 6650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22670-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-22670-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22669-4
Online ISBN: 978-3-642-22670-0
eBook Packages: Computer ScienceComputer Science (R0)