answersLogoWhite

0

Yes, but only if any language in NP has small uniform circuits.

Hope this helps. This is a famous unsolved problem, as whoever posted it here probably knows. A prize of one million US dollars has been offered for a solution. There are details at http://www.claymath.org/millennium/P_vs_NP/ At the top right of this page there is a link to the "Official problem description" by Stephen Cook, one of the people who first posed the problem in 1971, and also a more informal description under the heading "Minesweeper". Anyone who solves this problem will get not only a million dollars, but also enduring fame among mathematicians and computer scientists. It won't be easy, since a lot of clever people have worked on it since 1971. Most people believe that P is not equal to NP, but a belief is not the same as a proof.

User Avatar

Wiki User

16y ago

Still curious? Ask our experts.

Chat with our AI personalities

LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
ReneRene
Change my mind. I dare you.
Chat with Rene

Add your answer:

Earn +20 pts
Q: Does P equal NP
Write your answer...
Submit
Still have questions?
magnify glass
imp