Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

P = NP

Name: Anonymous 2011-10-04 1:26

Anyone else work on solving this problem through a polynomial time algorithm to a known np complete problem?

Name: Anonymous 2011-10-04 7:40

It's easy

if
P = NP
then by division by P
1 = N
solv'd

Newer Posts