Ist P in NP?
Das Kürzel steht aus historischen Gründen für „nichtdeterministisch polynomial“ und nicht etwa für „nicht-P“. Denn wenn Outputs von P-Algorithmen polynomial schnell generiert werden, sind sie natürlich auch polynomial schnell zu prüfen. P ist also eine Teilmenge von NP.
Was ist das NP?
Die Abkürzung np steht für: englisch: no problem (deutsch für „kein Problem“) in E-Mails und Internet-Chats, vergleiche Liste von Abkürzungen (Netzjargon) englisch: now playing (zu Deutsch etwa: „[ich] höre gerade“) in Chatrooms und Foren (siehe auch Netzjargon) englisch: non-public (deutsch: „nicht öffentlich“)
What’s the difference between a p and NP problem?
P versus NP problem, in computational complexity (a subfield of theoretical computer science and mathematics), the question of whether all so-called NP problems are actually P problems. A P problem is one that can be solved in “polynomial time,” which means that an algorithm exists for its solution
What does NP stand for in polynomial time?
NP (which stands for nondeterministic polynomial time) is the set of problems whose solutions can be verified in polynomial time. But as far as anyone can tell, many of those problems take exponential time to solve. Perhaps the most famous exponential-time problem in NP, for example, is finding prime factors of a large number.
When did Kurt Godel write the P vs NP problem?
If proved (and Nash was suitably skeptical) this would imply what is now called P ≠ NP, since a proposed key can easily be verified in polynomial time. Another mention of the underlying problem occurred in a 1956 letter written by Kurt Gödel to John von Neumann.
When did John Nash come up with the P vs NP problem?
In 1955, mathematician John Nash wrote a letter to the NSA, where he speculated that cracking a sufficiently complex code would require time exponential in the length of the key. If proved (and Nash was suitably skeptical) this would imply what is now called P ≠ NP, since a proposed key can easily be verified in polynomial time.