NP=P

BCS ao at pathlink.com
Sat Dec 13 11:43:48 PST 2008


Reply to Knud,

> Læs lige denne artikel
> 
> http://arxiv.org/abs/0812.1385
> 

If I'm reading that correctly, not exactly, the verbiage seems to imply that 
they didn't solve P=NP but a related problem.

"... these problems most of which are not believed to have even a polynomial 
time sequential algorithm."




More information about the Digitalmars-d-announce mailing list