1. Modern cryptography, probabilistic proofs, and pseudorandomness;Goldreich,1999
2. Sipser M. Introduction to the theory of computation [Section 10.6.3]. One-way functions. PWS Publishing; 1997. p. 374–6.
3. Papadimitriou C. Computational complexity [Section 12.1]. 1st ed. One-way functions. Addison Wesley; 1993. p. 279–98.
4. Limits to parallel computation: P-completeness theory;Greenlaw,1995
5. Cook, S. The P versus NP Problem. Available from: http://www.claymath.org/millennium/P_vs_NP/Official_Problem_Description.pdf.