3 ms·
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
by wslh 14y ago
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.
- tjgq 14y agoTechnically, you could prove P=NP without actually discovering a polynomial-time algorithm for an NP-hard problem. Not all proofs are constructive.