Solve P Vs NP

**Cypher** · 08-17-2010

I lol'd so ****ing hard. Gotta love these stupid freelancing sites.

Solve P Vs NP (Miscellaneous, Other (Programming), Programming)

**Opirity** · 08-17-2010

i dont understand this am i stupid?

**Sneakylemons** · 08-17-2010

That makes two of us Opi o.o I dont get it either

**Harko** · 08-17-2010

Originally Posted by ephecat

i dont understand this am i stupid?

one of the millenium questions. verification for a complex problem ({−2, −3, −10, 15} equals zero) is trivial but searching for the subset in {−2, −3, 15, 14, 7, −10} is not.

question is whether for each NP question a P solution exists.

user requests a P solution for a NP problem and people reply with: "I can do this".

**Snorkiee_** · 08-17-2010

Originally Posted by Harko

one of the millenium questions. verification for a complex problem ({−2, −3, −10, 15} equals zero) is trivial but searching for the subset in {−2, −3, 15, 14, 7, −10} is not.

question is whether for each NP question a P solution exists.

user requests a P solution for a NP problem and people reply with: "I can do this".

Wut?

(filler)

**Cheatz0** · 08-17-2010

Originally Posted by Snorkiee_

Wut?

(filler)

Millennium Prize Problems - Wikipedia, the free encyclopedia

**caytchen** · 08-17-2010

Actually, there has been someone recently who claimed to have solved it. Still pending peer review & verification: hp labs : research : SIMPL : people
(He bid, too!)

**Robske** · 08-17-2010

Thanks for the laugh, the comments are amazing

we have worked on such project recently and we can do this one too

**Apoc** · 08-17-2010

P vs NP is basically the 'god send' of computer mathematics. It'll effectively give us an equation of 'how to get the most out of the least'. (Which means 100+core CPUs, etc. There's an old Discovery channel program about the entire implications on IT)

**bonehand** · 08-17-2010

One of my coworkers had a good laugh, even if there is a paper trying to prove this, he's critical of the possibility of a simple solution. Like so many things befroe, it's quite possible that the solution is much simpler than we can devise because of how we overcomplicate everything...but I wouldn't bet on it =)

**namreeb** · 08-17-2010

I love all of the ignorant explanations of P vs NP. Suffice it to say, P vs NP is a theoretical relationship for computational problems. P vs NP is strongly believed to be true, and if it can be proven, we can infer lots of cool things. In practice, these cool things are inferred anyways with a "assuming P vs NP" preface.