New answers tagged

1

The title of the memcomputing article is clearly problematic from a complexity theorist's viewpoint. There is no rigorous proof that the analog implementation of memcomputing would converge in polynomial time to the inapproximability gap for general optimization problems. Even if it does, that doesn't say anything about the $P=NP$ problem because you have to ...


Top 50 recent answers are included