1. Non-interactive zero-knowledge and its applications;M Blum;Proceedings of the 20th Annual ACM symposium on Theory of computing (STOC '88),1988
2. The intrinsic computational difficulty of functions" Logic, Methodology and Philosophy of Science;A Cobham;Proc. 1964 International Congress,1965
3. Algorithmic Randomness and Complexity;R G Downey;Theory and Applications of Computability,2010