News for hackers. Stuff that matters.
Re:How would you responsibly disclose proof that p=np? by wslh on Sunday March 10, 2013 @10:41PM (#5354599)
This is the kind of thing that doesn't need peer review in a reputable journal. You can probe you point attacking NP algorithms in polynomial time, this is your proof, the reality.

Since there are security implications, giving an alert in advance is a good way to prevent side effects of your research.

Re:How would you responsibly disclose proof that p=np? by tjgq on Tuesday March 12, 2013 @07:17AM (#5361163)
Technically, you could prove P=NP without actually discovering a polynomial-time algorithm for an NP-hard problem. Not all proofs are constructive.