Ideas & society2015 · shared on Hacker News
Polynomial-Time Solution to an NP-Hard Problem with Digital Memcomputing Machine
Explore Polynomial-Time Solution to an NP-Hard Problem with Digital Memcomputing Machine, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Links found in the discussion
Up to 50 recent source links, in HN item order.
Ygodelmachine ·
Evidence of exponential speed-up in the solution of hard optimization problems?
141 points38 comments
Ycbennett ·
Polynomial-Time Solution to an NP-Hard Problem with Digital Memcomputing Machine
4 points0 comments
Yiamed2 ·
Digital Memcomputing Machines: Strong Evidence That P=NP
2 points1 comments