Author:
Heal Maher,Dashtipour Kia,Gogate Mandar
Publisher
Springer Nature Switzerland
Reference15 articles.
1. Carlson, J.A., Jaffe, A., Wiles, A.: The millennium prize problems. Cambridge, MA, American Mathematical Society, Providence, RI, Clay Mathematics Institute (2006)
2. Goldreich, O.: P, NP, and NP-Completeness: The basics of computational complexity. Cambridge University Press (2010)
3. Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 174. San Francisco: freeman (1979)
4. Fortnow, L.: The status of the P versus NP problem. Commun. ACM 52(9), 78–86 (2009)
5. Baker, T., Gill, J., Solovay, R.: Relativizations of the P=?NP question. SIAM J. Comput. 4(4), 431–442 (1975)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Intrusion Detection Systems Using Machine Learning;Advances in Information Security;2023-10-10
2. A Brief Overview of Randomized Algorithms;IOT with Smart Systems;2023
3. Formulations and Algorithms to Find Maximal and Maximum Independent Sets of Graphs;2022 International Conference on Computational Science and Computational Intelligence (CSCI);2022-12