695 citations · 2.6k across the 40 of their papers we have counts for
Showing 2014 · cs.ETShow all
2 papers · 2 filters
cs.ET2014
A review of "Mem-computing NP-complete problems in polynomial time using polynomial resources" (arXiv:1411.4798)
Igor L. Markov
The reviewed paper describes an analog device that empirically solves small instances of the NP-complete Subset Sum Problem (SSP). The authors claim that this device can solve the…
cs.ET2014★ 482 cited
Limits on Fundamental Limits to Computation
Igor L. Markov
An indispensable part of our lives, computing has also become essential to industries and governments. Steady improvements in computer hardware have been supported by periodic doub…