- #1

- 1,030

- 4

QUOTE:

- The book offers a new proof of the equality of the complexity classes "P" and "NP"

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- A
- Thread starter Dragonfall
- Start date

- #1

- 1,030

- 4

QUOTE:

- The book offers a new proof of the equality of the complexity classes "P" and "NP"

- #2

fresh_42

Mentor

- 14,887

- 12,428

Probably not worth a second of thought. (My thought.)

Edit: Or to quote Carl Sagan: Extraordinary claims need extraordinary evidence.

Edit: Or to quote Carl Sagan: Extraordinary claims need extraordinary evidence.

Last edited:

- #3

- 1,030

- 4

Well that extraordinary evidence is behind a $100 paywall

- #4

fresh_42

Mentor

- 14,887

- 12,428

I will wait until 2018 for the next Fields award instead. Seems to be cheaper. To me it is like those headlines nowadays: you get hooked, and if you have a closer look, it results in bare disappointment and anger about the wasted time. I can't imagine such a result in a textbook without any earthquakes far ahead of it. Even Wiles created tsunamis although his proof was understood by at most a dozen people at the time. (Not sure whether this has significantly changed.)

If I remember correctly, then NP can be done in polynomial time if one allows additional means like oracles or something. My bet would be, that the author(s)' arguments go along with such extensions, e.g. quantum computing or restrictions to incomplete NP problems. There has been a theorem on graph isomorphisms recently which pointed in a similar direction, of course without solving NP = P.

If I remember correctly, then NP can be done in polynomial time if one allows additional means like oracles or something. My bet would be, that the author(s)' arguments go along with such extensions, e.g. quantum computing or restrictions to incomplete NP problems. There has been a theorem on graph isomorphisms recently which pointed in a similar direction, of course without solving NP = P.

Last edited:

- #5

S.G. Janssens

Science Advisor

Education Advisor

- 958

- 728

It sounds nice. The old proof was rather dull.The book offers anewproof of the equality of the complexity classes "P" and "NP"

Share: