Ideas & society2015 · shared on Hacker News
Memcomputing NP-complete problems in polynomial time using polynomial resources
Explore Memcomputing NP-complete problems in polynomial time using polynomial resources, 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.
Yavinassh ·
Ask HN: What was the best CS paper you read in 2017?
558 points129 comments
Yjsnell ·
After Moore's Law: how phones are becoming open-source
92 points48 comments
Yfreefrancisco ·
Memcomputing NP-complete problems in polynomial time using polynomial resources
2 points0 comments
Yefm ·
Memcomputing NP-complete problems in polynomial time using polynomial resources
1 points1 comments