Author:
Fortnow Lance,Hitchcock John M.,Pavan A.,Vinodchandran N. V.,Wang Fengming
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing (to appear)
2. Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 384–393. IEEE Computer Society Press, Los Alamitos (2004)
3. Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 1–10 (2005)
4. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. In: Proceedings of the 26th Annual IEEE Conference on Foundations of Computer Science, pp. 429–442 (1985)
5. Hitchcock, J.M.: Effective Fractal Dimension: Foundations and Applications. PhD thesis, Iowa State University (2003)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献