P = NP ?

just read an article regarding maths... its abt P=NP?

lol...cant reli understand it after reading...

but roughly hav an idea wat it is abt...
here are some explaination of it:

Roughly speaking, P is a set of relatively easy problems, and NP is a set of what seem to be very, very hard problems, so P = NP would imply that the apparently hard problems actually have relatively easy solutions. But the details are more complicated.

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 problem in NP, for example, is finding prime factors of a large number. Verifying a solution just requires multiplication, but solving the problem seems to require systematically trying out lots of candidates.

So the question “Does P equal NP?” means “If the solution to a problem can be verified in polynomial time, can it be found in polynomial time?”

alright, wat i noe is multiplication of problems...

i stil dunno any algorithm for an NP-complete problem that runs in subexponential time...

P probably din equal NP...

watever la~