context: 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 problem are examples of problems believed to be NP-intermediate. They are some of the very few NP problems not known to be in P or to be NP-complete.
question: P = NP అనేది P లేదా NP-కంప్లీట్లో లేని సమస్యలను సూచిస్తుందని ఎవరు నిరూపించారు?
answers: Ladner Ladner Ladner