Search Mailing List Archives


Limit search to: Subject & Body Subject Author
Sort by: Reverse Sort
Limit to: All This Week Last Week This Month Last Month
Select Date Range     through    

[liberationtech] P=NP ?

x z xhzhang at gmail.com
Wed May 29 20:02:29 PDT 2013


I didn't read the paper but I did some research about the author Xinwen
Jiang. Jiang is actually a professor in NUDT (National University of
Defense Technology, a pretty scary one) in China. I found a blog of his (
http://blog.sina.com.cn/u/1423845304, it's in Chinese, one can use Google
Translate to understand what he's been up to). He has been touting this
research for quite several years, but I don't think it made any meaningful
noise even in China. No need to waste time on this.

-
Tom


2013/5/29 Andy Isaacson <adi at hexapodia.org>

> On Thu, May 30, 2013 at 12:12:15AM +0200, KheOps wrote:
> > This is not the first time such a claim is made, but I just came accross
> > what looks like to be a serious scientific publication claiming that
> > they prove that P=NP.
> >
> > In simple words, this would mean that problems that are considered as
> > needing a lot of computational effort to solve may in fact be solvable
> > with algorithms that need much less computational time than what is
> > implemented now. If proven true, this would have a particularly high
> > impact on a huge number of computational problems. I am however not sure
> > to what extent this would impact cryptography.
> >
> > http://arxiv.org/abs/1305.5976
>
> two days old, unknown researcher... probably a crackpot.  See the
> Deolalikar section of http://en.wikipedia.org/wiki/P=NP for the most
> recent previously heralded attempt.
>
> It's not the case that P=NP necessarily has particularly high impact on
> relevant problems.  If the reduction is in O(n^100) it's P but not
> useful in any reasonable sense.
>
> Even if the reduction is fast enough to be practical, applications are
> often far away.
>
> > I'd be glad if anyone with enough skills and access to the paper could
> > give a first opinion on it :)
>
> Shockingly, HN has a reasonable discussion.
> https://news.ycombinator.com/item?id=5785693
>
> -andy
> --
> Too many emails? Unsubscribe, change to digest, or change password by
> emailing moderator at companys at stanford.edu or changing your settings at
> https://mailman.stanford.edu/mailman/listinfo/liberationtech
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.stanford.edu/pipermail/liberationtech/attachments/20130529/a71e7fe6/attachment.html>


More information about the liberationtech mailing list