"The prime factorization problem is in the NP class, but we don't know if it is NP-hard. In other words, there is currently no proof that prime factorization problem cannot be solved polynomial time (= in P). ... As a side note, on a quantum computer, to factor an integer N, Shor's algorithm runs in polynomial time."

NP znamena ze nemas efektivny algoritmus, preto hovorim ze dokazat ze je nieco NP-hard je ako najst pattern v prvocislach
..nic nie je NP-hard
..cisla ktore nespadaju do ziadneho patternu volame prvocisla