1. Ajtai, M.: Generating hard instances of lattice problems. Quaderni di Matematica 13, 1–32 (2004). Preliminary version in STOC 1996
2. Lecture Notes in Computer Science;H Abusalah,2019
3. Cai, J., Lipton, R.J., Sedgewick, R., Yao, A.C.: Towards uncheatable benchmarks. In: Structure in Complexity Theory Conference, pp. 2–11 (1993)
4. Lecture Notes in Computer Science;B Cohen,2018
5. Lecture Notes in Computer Science;C Dwork,1993