William Gasarch, 95, 2014, 239
Sang-Un Lee, “Reverse Baby-step 2k-ary Adult-step Method for 𝜙((n) Decryption of Asymmetric-key RSA”, The Journal of the Institute of Webcasting, Internet and Telecommunication, 14, no. 6, 2014, 25
Rahul Ilango, “Constant Depth Formula and Partial Function Versions of MCSP Are Hard”, SIAM J. Comput., 2022, FOCS20-317
Madhu Sudan, Luca Trevisan, Salil Vadhan, “Pseudorandom Generators without the XOR Lemma”, Journal of Computer and System Sciences, 62, no. 2, 2001, 236
Stephen Cook, “The importance of the P versus NP question”, J. ACM, 50, no. 1, 2003, 27
L. Libkin, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999, 316
Ryan Williams, “Improving Exhaustive Search Implies Superpolynomial Lower Bounds”, SIAM J. Comput., 42, no. 3, 2013, 1218
Aloni Cohen, Saleet Klein, 9985, Theory of Cryptography, 2016, 84
Juraj Hromkovič, Peter Rossmanith, “What one has to know when attacking P vs. NP”, Journal of Computer and System Sciences, 107, 2020, 142
Scott Aaronson, “Quantum certificate complexity”, Journal of Computer and System Sciences, 74, no. 3, 2008, 313