P versus NP problem - Wikipedia, the free encyclopedia

P versus NP problem - Wikipedia, the free encyclopedia

瀏覽:1210
日期:2025-06-01
It was shown by Ladner that if P ≠ NP then there exist problems in NP that are neither in P nor NP-complete. Such problems are called NP-intermediate problems. The graph isomorphism problem, the discrete logarithm problem and the integer factorization pro...看更多